scientific article; zbMATH DE number 3568354

Cited in

(62)

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

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)