Pages that link to "Item:Q3730345"
From MaRDI portal
The following pages link to A competitive (dual) simplex method for the assignment problem (Q3730345):
Displayed 27 items.
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- Signature classes of transportation polytopes (Q689115) (← links)
- Active set algorithms for isotonic regression; a unifying framework (Q752010) (← links)
- Bounded isotonic median regression (Q804181) (← links)
- An infeasible (exterior point) simplex algorithm for assignment problems (Q811357) (← links)
- Sparse dual transportation polyhedra: Extreme points and signatures (Q911458) (← links)
- The auction algorithm for the transportation problem (Q918416) (← links)
- Worst case examples of an exterior point algorithm for the assignment problem (Q937404) (← links)
- A sequential dual simplex algorithm for the linear assignment problem (Q1108928) (← links)
- Personnel placement in a fuzzy environment (Q1185999) (← links)
- Solving linear bottleneck assignment problems via strong spanning trees (Q1200788) (← links)
- A combinatorial algorithm for the Euler equations of incompressible flows (Q1263396) (← links)
- The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412) (← links)
- An \(O(n^ 2)\) active set method for solving a certain parametric quadratic program (Q1321144) (← links)
- A new strongly polynomial dual network simplex algorithm (Q1373742) (← links)
- A new algorithm for the assignment problem: An alternative to the Hungarian method (Q1374026) (← links)
- On solving a variation of the assignment problem (Q1390267) (← links)
- Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times (Q1762149) (← links)
- A relaxation column signature method for assignment problems (Q1814258) (← links)
- The singly constrained assignment problem: An AP basis algorithm (Q1908532) (← links)
- Strongly polynomial simplex algorithm for bipartite vertex packing (Q1917242) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- An extended assignment problem considering multiple inputs and outputs (Q2470282) (← links)
- Adaptivity with moving grids (Q3638929) (← links)
- Transportation problems which can be solved by the use of hirsch-paths for the dual problems (Q3783840) (← links)
- Numerical resolution of an “unbalanced” mass transport problem (Q4442061) (← links)
- On the initialization methods of an exterior point algorithm for the assignment problem (Q5747723) (← links)