scientific article
From MaRDI portal
Publication:3328287
zbMath0539.90079MaRDI QIDQ3328287
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lagrangian relaxationschedulingboundsset coveringlocationbranch and bound algorithmassignmentrouting
Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (7)
Matching problems with generalized upper bound side constraints ⋮ Designing a supply chain network under the risk of disruptions ⋮ A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem ⋮ A method for solving to optimality uncapacitated location problems ⋮ Lagrangian relaxation and enumeration for solving constrained shortest-path problems ⋮ Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach ⋮ A facility reliability problem: Formulation, properties, and algorithm
This page was built for publication:
