An LP-rounding heuristic to solve a multi-period facility relocation problem
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) ; 168
- Klassifikation
-
Management
- Schlagwort
-
Supply Chain Design
Heuristic
Linear Programming
Rounding
- Ereignis
-
Veröffentlichung
- (wo)
-
Kaiserslautern
- (wer)
-
Fraunhofer-Institut für Techno- und Wirtschaftsmathematik, Fraunhofer (ITWM)
- (wann)
-
2009
- Urheber
-
Melo, T.
Nickel, S.
Saldanha-da-Gama, F.
- URN
-
urn:nbn:de:hbz:386-kluedo-16211
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:50 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Melo, T.
- Nickel, S.
- Saldanha-da-Gama, F.
- Fraunhofer-Institut für Techno- und Wirtschaftsmathematik, Fraunhofer (ITWM)
Entstanden
- 2009
Ähnliche Objekte (12)
Multi-period capacitated facility location under delayed demand satisfaction
A machine learning enhanced multi-start heuristic to efficiently solve a serial-batch scheduling problem
Two-phase heuristics for a multi-period capacitated facility location problem with service-differentiated customers
Robust multiperiod poverty comparisons
Multi-period disassembly planning
Robust Multiperiod Poverty Comparisons
Robust multiperiod poverty comparisons
Robust multiperiod poverty comparisons
About the Polynomial System Solve Facility of Axiom, Macsyma, Maple, Mathematica, MuPAD, and Reduce
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
Multi-period credit portfolio selection
Multi-period credit portfolio selection
Multi-period capacitated facility location under delayed demand satisfaction
A machine learning enhanced multi-start heuristic to efficiently solve a serial-batch scheduling problem
Two-phase heuristics for a multi-period capacitated facility location problem with service-differentiated customers
Robust multiperiod poverty comparisons
Multi-period disassembly planning
Robust Multiperiod Poverty Comparisons
Robust multiperiod poverty comparisons
Robust multiperiod poverty comparisons
About the Polynomial System Solve Facility of Axiom, Macsyma, Maple, Mathematica, MuPAD, and Reduce
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
Multi-period credit portfolio selection
Multi-period credit portfolio selection
Multi-period capacitated facility location under delayed demand satisfaction
A machine learning enhanced multi-start heuristic to efficiently solve a serial-batch scheduling problem
Two-phase heuristics for a multi-period capacitated facility location problem with service-differentiated customers
Robust multiperiod poverty comparisons
Multi-period disassembly planning
Robust Multiperiod Poverty Comparisons
Robust multiperiod poverty comparisons
Robust multiperiod poverty comparisons
About the Polynomial System Solve Facility of Axiom, Macsyma, Maple, Mathematica, MuPAD, and Reduce
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
Multi-period credit portfolio selection