Solution of preemptive multi-objective network design problems applying Benders decomposition method
From MaRDI portal
Publication:2442088
DOI10.1007/s10479-013-1353-0zbMath1284.90041OpenAlexW1993356786MaRDI QIDQ2442088
Publication date: 31 March 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-013-1353-0
Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)
Related Items
Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion, Convexity and optimization with copulæ structured probabilistic constraints
Cites Work
- Unnamed Item
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
- Generalized Benders' decomposition for topology optimization problems
- Urban rapid transit network design: accelerated Benders decomposition
- A review of interactive methods for multiobjective integer and mixed-integer programming
- An improved Benders decomposition applied to a multi-layer network design problem
- Improving Benders decomposition using a genetic algorithm
- Partitioning procedures for solving mixed-variables programming problems
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- On a variant of lexicographic multi-objective programming
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- A survey on Benders decomposition applied to fixed-charge network design problems
- A demand-shifting feasibility algorithm for Benders decomposition.
- Solving a capacitated hub location problem
- Generalized Benders decomposition
- A decomposition approach for global optimum search in QP, NLP and MINLP problems
- Capacity and flow assignment of data networks by generalized Benders decomposition
