scientific article; zbMATH DE number 3568354

Cited in

(62)

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