Lexicographic bottleneck problems
From MaRDI portal
Recommendations
Cites work
Cited in
(47)- Reshipments and overshipments in transportation problems with minimax objective
- On the lexicographic minimax approach to location problems
- On a variant of lexicographic multi-objective programming
- 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
- Computational aspects of the maximum diversity problem
- The bottleneck generalized assignment problem
- Lexicographic balanced optimization problems
- Solving some lexicographic multi-objective combinatorial problems
- A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
- Revisiting k-sum optimization
- The multiple objective time transportation problem with additional restrictions
- A fast algorithm for a class of bottleneck problems
- Lexicographic optima in the multicriteria discrete optimization problem
- The dominance assignment problem
- Exact lexicographic scheduling and approximate rescheduling
- An alternate approach to solve two-level priority based assignment problem
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
- Balanced flows for transshipment problems
- A priority based assignment problem
- A priority based unbalanced time minimization assignment problem
- Fair optimization and networks: a survey
- Identification of Petri nets from knowledge of their language
- A note on the asymptotic behaviour of bottleneck problems
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Max-min sum minimization transportation problem
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
- Sensitivity analysis for bottleneck assignment problems
- An iterative algorithm for two level hierarchical time minimization transportation problem
- On lexicographic optimal solutions in transportation problems
- Generalized multiple objective bottleneck problems
- An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
- On bilevel fractional programming
- A priority based time minimization transportation problem
- Discrete lexicographic p-bottleneck problems. I.
- Discrete lexicographic p-bottleneck problems. II.
- About a lexicographic multicriteria bottleneck problem
- Triangulations with Circular Arcs
- A class of bottleneck expansion 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
- Answer-set programming for lexicographical makespan optimisation in parallel machine scheduling
- Conjoint axiomatization of Min, DiscriMin and LexiMin
- Assignment problems: a golden anniversary survey
- Bottleneck partial-matching Voronoi diagrams and applications
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)
