The following pages link to (Q4132006):
Displayed 33 items.
- Bounded isotonic median regression (Q804181) (← links)
- A simplex algorithm for piecewise-linear fractional programming problems (Q859908) (← links)
- A projection method for the uncapacitated facility location problem (Q918404) (← links)
- Models for multimode multicommodity location problems with interdepot balancing requirements (Q920012) (← links)
- A comparison of two dual-based procedures for solving the p-median problem (Q1058960) (← links)
- 'Multidimensional' extensions and a nested dual approach for the m-median problem (Q1072925) (← links)
- The transformation technique for a class of variable upper bounding constraints in linear programming (Q1091936) (← links)
- Exploiting special structure in Karmarkar's linear programming algorithm (Q1106098) (← links)
- Lot-size models with backlogging: Strong reformulations and cutting planes (Q1115342) (← links)
- A cost operator approach to multistage location-allocation (Q1148206) (← links)
- A tree search algorithm for the p-median problem (Q1162434) (← links)
- Locational analysis (Q1173002) (← links)
- A generalisation of variable upper bounding and generalised upper bounding (Q1247367) (← links)
- Planning and scheduling packaging lines in food industry (Q1309991) (← links)
- Locating service centers with precedence constraints (Q1314338) (← links)
- Dynamic factorization in large-scale optimization (Q1330893) (← links)
- Uncapacitated facility location: General solution procedure and computational experience (Q1333489) (← links)
- A solver for the multi-objective transshipment problem with facility location (Q1823841) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- Valid integer polytope (VIP) penalties for branch-and-bound enumeration (Q1977646) (← links)
- A heuristic preprocessor supported algorithm for the capacitated plant location problem (Q2276874) (← links)
- On solving the discrete location problems when the facilities are prone to failure (Q2477339) (← links)
- An ex-post bound on the greedy heuristic for the uncapacitated facility location problem (Q3411298) (← links)
- Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
- A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization (Q3867585) (← links)
- Identification of special structure constraints in linear programs (Q3920989) (← links)
- An implementation of the simplex method for linear programming problems with variable upper bounds (Q3934132) (← links)
- A Primal Approach to the Simple Plant Location Problem (Q3958238) (← links)
- A Canonical Representation of Simple Plant Location Problems and Its Applications (Q3967331) (← links)
- Variations and extensions of Proll's integer linear programming formulation techniques for the graph partitioning problem (Q4008221) (← links)
- An Implementation of Variable Upper Bounds via SUB Methodology (Q4008468) (← links)
- Implicit representation of generalized variable upper bounds in linear programming (Q4162962) (← links)
- Dual simplex algorithm with implicit representation of variable upper bounds (Q4836772) (← links)