Showing 1 - 10 of 876
Persistent link: https://www.econbiz.de/10010380157
In this paper we study the problem of designing a survivable telecommunication network with shared-protection routing. We develop a heuristic algorithm to solve this problem. Recent results in the area of global re-routing have been used to obtain very tight lower bounds for the problem. Our...
Persistent link: https://www.econbiz.de/10010871256
Persistent link: https://www.econbiz.de/10011802231
Persistent link: https://www.econbiz.de/10010401595
Redistricting, the redrawing of congressional district boundaries within the states, may occur every 10 years on the basis of the population census. Many redistricting plans are designed with partisan politics in mind, resulting in disputes and forcing judges to intervene. We address this...
Persistent link: https://www.econbiz.de/10009204059
In the oil industry, different oil components are blended in a refinery to fuel products. These products are transported to different harbors by ship. Due to the limited storage capacity at the harbors and the undesirability of a stock-out, inventory levels at the harbors have to be taken into...
Persistent link: https://www.econbiz.de/10011149242
We present node-arc and arc-path formulations, and develop a branch-and-price approach for the directed network design problem with relays (DNDR). The DNDR problem can be used to model many network design problems in transportation, service, and telecommunication system, where relay points are...
Persistent link: https://www.econbiz.de/10010870971
In the Distance Constrained Multiple Vehicle Traveling Purchaser Problem (DC-MVTPP) a fleet of vehicles is available to visit suppliers offering products at different prices and with different quantity availabilities. The DC-MVTPP consists in selecting a subset of suppliers so to satisfy...
Persistent link: https://www.econbiz.de/10010744226
We study a vehicle routing problem with soft time windows and stochastic travel times. In this problem, we consider stochastic travel times to obtain routes which are both efficient and reliable. In our problem setting, soft time windows allow early and late servicing at customers by incurring...
Persistent link: https://www.econbiz.de/10011097851
This paper presents the first full-fledged branch-and-price (bap) algorithm for the capacitated arc-routing problem (CARP). Prior exact solution techniques either rely on cutting planes or the transformation of the CARP into a node-routing problem. The drawbacks are either models with inherent...
Persistent link: https://www.econbiz.de/10009484575