Login / Signup
A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects.
Hanyu Gu
Andreas Schutt
Peter J. Stuckey
Published in:
CPAIOR (2013)
Keyphrases
</>
lagrangian relaxation
resource constrained
forward backward
feasible solution
integer programming
lower bound
resource constraints
linear programming
dynamic programming
branch and bound algorithm
lower and upper bounds
column generation
hidden markov models
wireless sensor networks
mixed integer programming
mixed integer program
lagrangian heuristic
np hard
sensor networks
randomly generated test problems
dual decomposition
multipath
tabu search
optimal solution
sensor nodes
shortest path
objective function
network design problem
special case
valid inequalities
linear program
mathematical model
cutting plane
scheduling problem
real time