Toggle navigation
Publications
Researchers
Institutions
0
Sign In
Federated Authentication
(Click on the image)
Local Sign In
Password Recovery
Register
Sign In
Publications
Search
Statistics
A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem
AuthID
P-00W-QES
2
Author(s)
Godinho, N
·
Paquete, L
5
Editor(s)
Kotsireas,IS;Pardalos,PM;Parsopoulos,KE;Souravlias,D;Tsokas,A
Document Type
Proceedings Paper
Year published
2019
Published
in
Analysis of Experimental Algorithms - Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers
in
Lecture Notes in Computer Science
Volume: 11544, Pages: 69-81
Indexing
Dblp
®
/en/publications/view/941529
Metadata
Sources
Publication Identifiers
Dblp
: conf/sea2/GodinhoP19
Export Publication Metadata
Export
×
Publication Export Settings
BibTex
EndNote
APA
Export Preview
Marked List
Add to Marked List
Info
At this moment we don't have any links to full text documens.
×
Select Source
This publication has:
2 records from
ISI
2 records from
SCOPUS
2 records from
DBLP
2 records from
Unpaywall
2 records from
Openlibrary
2 records from
Handle
Please select which records must be used by Authenticus!
×
Preview Publications
© 2024 CRACS & Inesc TEC - All Rights Reserved
Privacy Policy
|
Terms of Service