Lexicographic bottleneck problems
From MaRDI portal
Publication:1180835
DOI10.1016/0167-6377(91)90018-KzbMath0744.90069OpenAlexW1985706454MaRDI QIDQ1180835
Franz Rendl, Rainer E. Burkard
Publication date: 27 June 1992
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(91)90018-k
bottleneck objective functiongeneric solution procedureslexicographic solutionpolynomial running time
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items
A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness ⋮ An iterative algorithm for two level hierarchical time minimization transportation problem ⋮ Assignment problems: a golden anniversary survey ⋮ Computational aspects of the maximum diversity problem ⋮ A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem ⋮ Lexicographic optima in the multicriteria discrete optimization problem ⋮ A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks ⋮ Revisiting \(k\)-sum optimization ⋮ The dominance assignment problem ⋮ The bottleneck generalized assignment problem ⋮ Sensitivity analysis for bottleneck assignment problems ⋮ Solving simultaneous target assignment and path planning efficiently with time-independent execution ⋮ On bilevel fractional programming ⋮ A solution technique for capacitated two-level hierarchical time minimization transportation problem ⋮ Bottleneck partial-matching Voronoi diagrams and applications ⋮ On lexicographic optimal solutions in transportation problems ⋮ Generalized multiple objective bottleneck problems ⋮ Reshipments and overshipments in transportation problems with minimax objective ⋮ Balanced flows for transshipment problems ⋮ Identification of Petri nets from knowledge of their language ⋮ A class of bottleneck expansion problems ⋮ Conjoint axiomatization of Min, DiscriMin and LexiMin ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Exact lexicographic scheduling and approximate rescheduling ⋮ Max-min sum minimization transportation problem ⋮ A priority based assignment problem ⋮ Triangulations with Circular Arcs ⋮ A priority based unbalanced time minimization assignment problem ⋮ On the lexicographic minimax approach to location problems ⋮ A priority based time minimization transportation problem ⋮ On a variant of lexicographic multi-objective programming ⋮ Fair optimization and networks: a survey ⋮ The stochastic bottleneck linear programming problem ⋮ An improved general procedure for lexicographic bottleneck problems ⋮ Lexicographic bottleneck combinatorial problems ⋮ Computing improved optimal solutions to max-min flexible constraint satisfaction problems ⋮ An alternate approach to solve two-level priority based assignment problem ⋮ The multiple objective time transportation problem with additional restrictions
Cites Work
