Ordinal-Optimization Concept Enabled Decomposition and Coordination of Mixed-Integer Linear Programming Problems

Many important optimization problems, such as manufacturing scheduling and power system unit commitment, are formulated as Mixed-Integer Linear Programming (MILP) problems. Such problems are generally difficult to solve because of their combinatorial nature, and may subject to strict computation tim...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE robotics and automation letters Ročník 5; číslo 4; s. 5051 - 5058
Hlavní autori:	Liu, An-Bang, Luh, Peter B., Bragin, Mikhail A., Yan, Bing
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Piscataway IEEE 01.10.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Combinatorial analysis Complexity theory Computing time Convergence Coordination Decomposition Generalized assignment problems (GAPs) Integer programming Integers Linear programming Linearity Manufacturing Mathematical programming Mixed integer linear programming Mixed-integer linear programming (MILP) Optimization Ordinal optimization (OO) Planning Scheduling and Coordination Surrogate absolute-value Lagrangian relaxation (SAVLR) Unit commitment
ISSN:	2377-3766, 2377-3766
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!