scientific article; zbMATH DE number 3561083
From MaRDI portal
Publication:4132006
Cited in
(35)- A tree search algorithm for the p-median problem
- On solving the discrete location problems when the facilities are prone to failure
- A heuristic preprocessor supported algorithm for the capacitated plant location problem
- Models for multimode multicommodity location problems with interdepot balancing requirements
- Dynamic factorization in large-scale optimization
- Lot-size models with backlogging: Strong reformulations and cutting planes
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
- A projection method for the uncapacitated facility location problem
- Uncapacitated facility location: General solution procedure and computational experience
- An Implementation of Variable Upper Bounds via SUB Methodology
- A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization
- A Primal Approach to the Simple Plant Location Problem
- A Canonical Representation of Simple Plant Location Problems and Its Applications
- The transformation technique for a class of variable upper bounding constraints in linear programming
- An aggressive reduction scheme for the simple plant location problem
- Large-scale linear programming: Geometry, working bases and factorizations
- Exploiting special structure in Karmarkar's linear programming algorithm
- An ex-post bound on the greedy heuristic for the uncapacitated facility location problem
- Valid integer polytope (VIP) penalties for branch-and-bound enumeration
- A generalisation of variable upper bounding and generalised upper bounding
- Locational analysis
- Bounded isotonic median regression
- A simplex algorithm for piecewise-linear fractional programming problems
- Implicit representation of generalized variable upper bounds in linear programming
- An implementation of the simplex method for linear programming problems with variable upper bounds
- Variations and extensions of Proll's integer linear programming formulation techniques for the graph partitioning problem
- Identification of special structure constraints in linear programs
- Locating service centers with precedence constraints
- Planning and scheduling packaging lines in food industry
- A comparison of two dual-based procedures for solving the p-median problem
- The simple plant location problem: Survey and synthesis
- A cost operator approach to multistage location-allocation
- A solver for the multi-objective transshipment problem with facility location
- Dual simplex algorithm with implicit representation of variable upper bounds
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132006)
