scientific article; zbMATH DE number 1187081

MaRDI QIDQ3840283zbMATH OpenFDO

Authors Kaj Holmberg, Mikael Rönnqvist, Di Yuan

Publication date 10 August 1998

zbMATH Keywords

matchinglocationbranch-and-boundLagrangean relaxationsubgradient search

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• An exact algorithm for the capacitated facility location problems with single sourcing
• A repeated matching heuristic for the single-source capacitated facility location problem
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• Approximate solutions to large scale capacitated facility location problems
• Efficient solution of large scale, single-source, capacitated plant location problems

Cited in

(8)

• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• An exact algorithm for the capacitated facility location problems with single sourcing
• A heuristic for BILP problems: the single source capacitated facility location problem
• On single-source capacitated facility location with cost and fairness objectives
• A capacitated facility location and inventory management problem with single sourcing
• A repeated matching heuristic for the single-source capacitated facility location problem
• A cut-and-solve based algorithm for the single-source capacitated facility location problem
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem

Describes a project that uses

Uses Software

• CPLEX

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 Q3840283)