Solving some lexicographic multi-objective combinatorial problems

DOI10.1016/S0377-2217(01)00214-4MaRDI QIDQ1598728zbMATH OpenFDO

Authors A. Volgenant

Publication date 28 May 2002

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationminimum spanning treecomplexityshortest pathlinear assignmentlexicographic multi-objective optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• Lexicographic bottleneck combinatorial problems
• Lexicographic bottleneck problems
• An improved general procedure for lexicographic bottleneck problems
• scientific article; zbMATH DE number 1748022
• Generalized multiple objective bottleneck problems

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• A linear time algorithm for the maximum capacity path problem
• A note on two problems in connexion with graphs
• An Appraisal of Some Shortest-Path Algorithms
• An algorithm for the ranking of shortest paths
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
• Finding the k Shortest Paths
• Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
• Lexicographic bottleneck combinatorial problems
• Minimum deviation and balanced optimization: A unified approach
• On dual solutions of the linear assignment problem
• The Min-Max Spanning Tree Problem and some extensions
• The assignment problem with seniority and job priority constraints
• The partial sum criterion for Steiner trees in graphs and shortest paths
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees

Cited in

(9)

• Assignment problems: a golden anniversary survey
• Extensions of dynamic programming for multi-stage combinatorial optimization
• scientific article; zbMATH DE number 1748022 (Why is no real title available?)
• Lexicographic optimality in the multiple objective linear programming: The nucleolar solution
• A note on the assignment problem with seniority and job priority constraints.
• An addendum on: ``Sensitivity analysis of the optimal assignment
• Lexicographic optimisation in generalised network flow problems
• Lexicographic maximin optimisation for fair bandwidth allocation in computer networks
• Computational complexity of convoy movement planning problems

Describes a project that uses

Uses Software

• Algorithm 360

This page was built for publication: Solving some lexicographic multi-objective combinatorial problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1598728)