A fast and robust algorithm for solving biobjective mixed integer programs

We present a fast and robust algorithm for solving biobjective mixed integer linear programs. Two existing methods are studied: ϵ -Tabu Method and the Boxed Line Method. By observing structural characteristics of nondominated frontiers and computational bottlenecks, we develop enhanced versions of e...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Mathematical methods of operations research (Heidelberg, Germany) Germany), 2024-08, Vol.100 (1), p.221-262
Hauptverfasser:	Pecin, Diego, Herszterg, Ian, Perini, Tyler, Boland, Natashia, Savelsbergh, Martin
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Business and Management Calculus of Variations and Optimal Control Optimization Integer programming Mathematics Mathematics and Statistics Mixed integer Operations Research/Decision Theory Original Article Robustness
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!