Solving some lexicographic multi-objective combinatorial problems
From MaRDI portal
Publication:1598728
DOI10.1016/S0377-2217(01)00214-4zbMath0994.90125MaRDI QIDQ1598728
Publication date: 28 May 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
complexityshortest pathcombinatorial optimizationminimum spanning treelinear assignmentlexicographic multi-objective optimization
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)
Related Items
Assignment problems: a golden anniversary survey, Extensions of dynamic programming for multi-stage combinatorial optimization, A note on the assignment problem with seniority and job priority constraints., Lexicographic maximin optimisation for fair bandwidth allocation in computer networks, Computational complexity of convoy movement planning problems, An addendum on: ``Sensitivity analysis of the optimal assignment
Uses Software
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- On dual solutions of the linear assignment problem
- Minimum deviation and balanced optimization: A unified approach
- A linear time algorithm for the maximum capacity path problem
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
- The Min-Max Spanning Tree Problem and some extensions
- The partial sum criterion for Steiner trees in graphs and shortest paths
- Lexicographic bottleneck combinatorial problems
- An algorithm for the ranking of shortest paths
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
- The Assignment Problem with Seniority and Job Priority Constraints
- Finding the k Shortest Paths
- An Appraisal of Some Shortest-Path Algorithms
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
