scientific article; zbMATH DE number 3858858
From MaRDI portal
Publication:3328287
assignmentboundsbranch and bound algorithmLagrangian relaxationlocationroutingschedulingset covering
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)
Cited in
(13)- Solution of a tinned iron purchasing problem by Lagrangean relaxation
- A relaxation algorithm for solving mixed integer programming problems
- Designing a supply chain network under the risk of disruptions
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
- The Lagrangian relaxation for the combinatorial integral approximation problem
- Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach
- Matching problems with generalized upper bound side constraints
- A facility reliability problem: Formulation, properties, and algorithm
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- A lagrangean relaxation algorithm for the constrained matrix problem
- pth power Lagrangian method for integer programming
- About Lagrangian methods in integer optimization
- 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 Q3328287)
