Lexicographic bottleneck problems
From MaRDI portal
Recommendations
Cites work
Cited in
(45)- A priority based time minimization transportation problem
- A priority based assignment problem
- Lexicographic balanced optimization problems
- Identification of Petri nets from knowledge of their language
- The multiple objective time transportation problem with additional restrictions
- Assignment problems: a golden anniversary survey
- Bottleneck partial-matching Voronoi diagrams and applications
- An alternate approach to solve two-level priority based assignment problem
- About a lexicographic multicriteria bottleneck problem
- Discrete lexicographic \(p\)-bottleneck problems. I.
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
- The bottleneck generalized assignment problem
- On lexicographic optimal solutions in transportation problems
- Max-min sum minimization transportation problem
- Conjoint axiomatization of Min, DiscriMin and LexiMin
- A note on the asymptotic behaviour of bottleneck problems
- Balanced flows for transshipment problems
- Lexicographic optima in the multicriteria discrete optimization problem
- On the lexicographic minimax approach to location problems
- The dominance assignment problem
- Exact lexicographic scheduling and approximate rescheduling
- Generalized multiple objective bottleneck problems
- Computing improved optimal solutions to max-min flexible constraint satisfaction problems
- An iterative algorithm for two level hierarchical time minimization transportation problem
- The stochastic bottleneck linear programming problem
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
- An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
- An improved general procedure for lexicographic bottleneck problems
- Lexicographic bottleneck combinatorial problems
- Solving simultaneous target assignment and path planning efficiently with time-independent execution
- A solution technique for capacitated two-level hierarchical time minimization transportation problem
- Reshipments and overshipments in transportation problems with minimax objective
- Sensitivity analysis for bottleneck assignment problems
- A priority based unbalanced time minimization assignment problem
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
- Computational aspects of the maximum diversity problem
- Triangulations with Circular Arcs
- Discrete lexicographic \(p\)-bottleneck problems. II.
- A class of bottleneck expansion problems
- Revisiting k-sum optimization
- On bilevel fractional programming
- Fair optimization and networks: a survey
- On a variant of lexicographic multi-objective programming
- Solving some lexicographic multi-objective combinatorial problems
This page was built for publication: Lexicographic bottleneck problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180835)
