scientific article; zbMATH DE number 3568354
From MaRDI portal
Publication:4139967
zbMath0364.90068MaRDI QIDQ4139967
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Optimal and heuristic algorithms for multiproduct uncapacitated facility location, Uncapacitated facility location: General solution procedure and computational experience, A monotonic, dual-based bounding procedure for integer programs, Models and algorithms for network reduction, Strengthening the reliability fixed-charge location model using clique constraints, A hybrid multistart heuristic for the uncapacitated facility location problem, Location and layout planning. A survey, On the exact solution of large-scale simple plant location problems, A direct dual method for the mixed plant location problem with some side constraints, A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements, The capacitated plant location problem, Matheuristics: survey and synthesis, Agile optimization for a real‐time facility location problem in Internet of Vehicles networks, Polyhedral results and stronger Lagrangean bounds for stable spanning trees, A cost operator approach to multistage location-allocation, On a class of subadditive duals for the uncapacitated facility location problem, Lagrangean decomposition: A model yielding stronger lagrangean bounds, Information-theoretic approaches to branching in search, A Lagrangean dual ascent algorithm for simple plant location problems, On a particular problem of service allocation, A method for solving to optimality uncapacitated location problems, Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem, Locational analysis, Fast primal and dual heuristics for the \(p\)-median location problem, An exact cooperative method for the uncapacitated facility location problem, Threshold robustness in discrete facility location problems: a bi-objective approach, Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup, RAMP algorithms for the capacitated facility location problem, A dual ascent approach for steiner tree problems on a directed graph, An homage to Joseph-Louis Lagrange and Pierre Huard, Dual ascent: variations of a theme, Fast bounding procedures for large instances of the simple plant location problem, An application of a Lagrangian-type relaxation for the uncapacitated facility location problem, Worst-case performance of Wong's Steiner tree heuristic, Siting noxious facilities under uncertainty, An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem, Location analysis: a synthesis and survey, An improved Lagrangian relaxation and dual ascent approach to facility location problems, Affinity propagation and uncapacitated facility location problems, An aggressive reduction scheme for the simple plant location problem, A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem, Modeling and Managing Uncertainty in Process Planning and Scheduling, A separation algorithm for the simple plant location problem, Maximization of submodular functions: theory and enumeration algorithms, Single machine earliness and tardiness scheduling, A branch and bound algorithm for the traveling purchaser problem, An application-oriented guide for designing Lagrangean dual ascent algorithms, Solving the plant location problem on a line by linear programming, The simple plant location problem: Survey and synthesis, Heuristics for the capacitated plant location model, Separating lifted odd-hole inequalities to solve the index selection problem, A branch-and-bound algorithm for the multi-level uncapacitated facility location problem, A tree search algorithm for the multi-commodity location problem, Principal direction search: A new method of search for unconstrained LP formulations, An extension of set partitioning with application to scheduling problems, Integer programming formulations of discrete hub location problems, Facility location models for distribution planning, An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type, 'Multidimensional' extensions and a nested dual approach for the m-median problem, Facility location with increasing production costs
