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