Publicações

A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem

AuthID
P-00R-H3G

Author(s)

Godinho, N

Paquete, L

Editor(s)

Kotsireas, I; Pardalos, P; Parsopoulos, KE; Souravlias, D; Tsokas, A

Document Type

Proceedings Paper

Year published

2019

Published

in ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019 in Lecture Notes in Computer Science, ISSN: 0302-9743

Volume: 11544, Pages: 69-81 (13)

Conference

Conference on Analysis of Experimental Algorithms (Sea2), Date: JUN 24-29, 2019, Location: Kalamata, GREECE, Sponsors: CARGO Lab, CAO, High Performance Intelligent Comp & Signal Proc Lab

Indexing

Wos^®

Scopus^®

Google Scholar^®

Metadata
Sources

Publication Identifiers

DOI: 10.1007/978-3-030-34029-2_5

Scopus: 2-s2.0-85076440240

Wos: WOS:000582476700005

Source Identifiers

ISSN: 0302-9743

Export Publication Metadata

Lista Marked

Adicionar à lista Marked

Info

At this moment we don't have any links to full text documens.

A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem

Useful Links

Get Help

Autenticação Federada (Click on the image)

A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem

Useful Links

Get Help