scientific article; zbMATH DE number 3885614

MaRDI QIDQ3220311zbMATH OpenFDO

Authors Monique Guignard

Publication date 1984

zbMATH Keywords

capacity constraintsComputational resultsdual and primal heuristicsdual ascent methodenumeration schemefacility locationlocation/\(distribution\) problems over networkspotential nodes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• Efficient primal-dual heuristic for a dynamic location problem
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• On a general network location--production--allocation problem
• A Dual-Based Add Heuristic for Uncapacitated Facility Location
• Technical Note—On the Equivalence of Dual Methods for Two Location Problems

Cited in

(10)

• On a general network location--production--allocation problem
• Exact sequential choice of locations in a network
• Primal-dual algorithms for connected facility location problems
• Dual-ascent and primal heuristics for production-assembly-distribution system design
• Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
• Technical Note—On the Equivalence of Dual Methods for Two Location Problems
• scientific article; zbMATH DE number 1947062 (Why is no real title available?)
• Heuristics for budget facility location-network design problems with minisum objective
• Composite Regions of Feasibility for Certain Classes of Distance Constrained Network Location Problems
• Efficient primal-dual heuristic for a dynamic 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 Q3220311)