Relax-and-Cut for Capacitated Network Design

We present an evaluation of a Lagrangean-based branch-and-bound algorithm with additional valid inequalities for the capacitated network design problem. The focus is on two types of valid inequalities, the cover inequalities and local cuts. We show how these inequalities can be considered in a Lagra...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Kliewer, Georg, Timajev, Larissa
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Bundle Method Computer science control theory systems Exact sciences and technology Lagrangian Relaxation Network Design Network Design Problem Theoretical computing Valid Inequality
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!