The following pages link to Lexicographic bottleneck problems (Q1180835):
Displayed 38 items.
- An iterative algorithm for two level hierarchical time minimization transportation problem (Q319851) (← links)
- Generalized multiple objective bottleneck problems (Q453049) (← links)
- Conjoint axiomatization of Min, DiscriMin and LexiMin (Q703385) (← links)
- Assignment problems: a golden anniversary survey (Q852938) (← links)
- Bottleneck partial-matching Voronoi diagrams and applications (Q902422) (← links)
- Reshipments and overshipments in transportation problems with minimax objective (Q1182137) (← links)
- On the lexicographic minimax approach to location problems (Q1278138) (← links)
- On a variant of lexicographic multi-objective programming (Q1296132) (← links)
- The stochastic bottleneck linear programming problem (Q1304778) (← links)
- An improved general procedure for lexicographic bottleneck problems (Q1306359) (← links)
- Lexicographic bottleneck combinatorial problems (Q1306468) (← links)
- Computing improved optimal solutions to max-min flexible constraint satisfaction problems (Q1307812) (← links)
- Computational aspects of the maximum diversity problem (Q1360111) (← links)
- The bottleneck generalized assignment problem (Q1388853) (← links)
- A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem (Q1652389) (← links)
- Revisiting \(k\)-sum optimization (Q1675256) (← links)
- The multiple objective time transportation problem with additional restrictions (Q1869663) (← links)
- Lexicographic optima in the multicriteria discrete optimization problem (Q1916633) (← links)
- The dominance assignment problem (Q1926493) (← links)
- Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
- An alternate approach to solve two-level priority based assignment problem (Q2114824) (← links)
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness (Q2125539) (← links)
- Balanced flows for transshipment problems (Q2235277) (← links)
- A priority based assignment problem (Q2293428) (← links)
- A priority based unbalanced time minimization assignment problem (Q2307977) (← links)
- Fair optimization and networks: a survey (Q2336590) (← links)
- Identification of Petri nets from knowledge of their language (Q2465425) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Max-min sum minimization transportation problem (Q2507394) (← links)
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks (Q2664012) (← links)
- Sensitivity analysis for bottleneck assignment problems (Q2673565) (← links)
- On lexicographic optimal solutions in transportation problems (Q4340165) (← links)
- On bilevel fractional programming (Q4859832) (← links)
- A priority based time minimization transportation problem (Q4987785) (← links)
- Triangulations with Circular Arcs (Q5895516) (← links)
- A class of bottleneck expansion problems (Q5936134) (← links)
- Solving simultaneous target assignment and path planning efficiently with time-independent execution (Q6108766) (← links)
- A solution technique for capacitated two-level hierarchical time minimization transportation problem (Q6164324) (← links)