112 search results - page 5 / 23 » Lagrangian Relaxation |
HEURISTICS
2002
13 years 7 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
EVOW
2007
Springer
14 years 1 months ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We present a novel primal-dual analysis on a class of NPhard sparsity minimization problems to provide new interpretations for their well known convex relaxations. We show that th...
NETWORKS
2008
13 years 7 months ago
2008
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
RECOMB
2002
Springer
14 years 7 months ago
2002
Springer