A cut-and-solve based algorithm for the single-source capacitated facility location problem

► The Single Source Capacitated Facility Location Problem (SSCFLP) is studied. ► A cut-and-solve based exact method is proposed for SSCFLP. ► New Fenchel cutting plane algorithm is proposed to separate 0–1 knapsack polytopes. ► Partial integrality strategy is used to further tighten the lower bound...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 221; H. 3; S. 521 - 532
Hauptverfasser:	Yang, Zhen, Chu, Feng, Chen, Haoxun
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 16.09.2012 Elsevier Elsevier Sequoia S.A
Schlagworte:	Algorithms Applied sciences Branch & bound algorithms Computer Science Cut-and-solve Cutting Cutting stock problem Cutting-plane method Exact sciences and technology Facility location Flows in networks. Combinatorial problems Integer programming Logistics Lower bounds Mathematical analysis Mathematical models Mathematical programming Operational research and scientific management Operational research. Management science Operations Research Optimization algorithms Planes Position (location) Strategy Studies Facility location Cut-and-solve Cutting-plane method Polytope Branching Lower bound Tree(graph) Mixed integer programming Combinatorial optimization Cutting plane method Location problem Knapsack problem Upper bound Zero one programming Experimental design Capacity constraint
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!