Sciweavers

16091 search results - page 94 / 3219
» Solving
Sort
View
NETWORKS
2008
13 years 7 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
NETWORKS
2008
13 years 7 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
ANOR
2005
124views more  ANOR 2005»
13 years 7 months ago
On Compact Formulations for Integer Programs Solved by Column Generation
Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subprobl...
Daniel Villeneuve, Jacques Desrosiers, Marco E. L&...
AIR
2004
134views more  AIR 2004»
13 years 7 months ago
Combining Meta-Heuristics to Effectively Solve the Vehicle Routing Problems with Time Windows
The vehicle routing problems with time windows are challenging delivery problems in which instances involving 100 customers or more can be difficult to solve. There were many inter...
Vincent Tam, Keng Teck Ma
TWC
2008
158views more  TWC 2008»
13 years 7 months ago
Solving Box-Constrained Integer Least Squares Problems
A box-constrained integer least squares problem (BILS) arises from several wireless communications applications. Solving a BILS problem usually has two stages: reduction (or prepro...
Xiao-Wen Chang, Qing Han