Bilevel time minimizing assignment problem
From MaRDI portal
Recommendations
- Bilevel time minimizing transportation problem
- On a pair of job-machine assignment problems with two stages
- A lexi-search algorithm for a time minimizing assignment problem.
- An improved algorithm for two stage time minimization assignment problem
- Two level hierarchical time minimizing transportation problem
Cites work
- A min max problem
- A strongly polynomial minimum cost circulation algorithm
- An algorithm for the bottleneck generalized assignment problem
- Bottleneck assignment problems under categorization
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Network flows. Theory, algorithms, and applications.
- On the bottleneck assignment problem
- On the solution of a stochastic bottleneck assignment problem and its variations
- Solving the Assignment Problem by Relaxation
- Some Generalisations of the Time Minimising Assignment Problem
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
- The alternating basis algorithm for assignment problems
Cited in
(6)- A variant of time minimizing assignment problem
- Exact solution approaches for bilevel assignment problems
- Bilevel optimization: theory, algorithms, applications and a bibliography
- An efficient solution approach to capacitated bilevel time minimizing transportation problem
- On a pair of job-machine assignment problems with two stages
- Bilevel time minimizing transportation problem
This page was built for publication: Bilevel time minimizing assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q865542)