A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects

DOI10.1007/978-3-642-38171-3_24zbMath1382.90120OpenAlexW35553862MaRDI QIDQ4922923

Peter J. Stuckey, Andreas Schutt, Han-Yu Gu

Publication date: 4 June 2013

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38171-3_24

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Constraint programming and operations research ⋮ Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining

This page was built for publication: A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects