Sciweavers

327 search results - page 38 / 66
» Cutting planes in integer and mixed integer programming
Sort
View
CIS
2008
Springer
15 years 3 months ago
A Near-Optimal Redundancy Allocation Strategy that Minimizes a System's Vulnerability to Hazardous Events and Malicious Attacks
Delivering continuous services in information infrastructures is a major challenge. For system or network administrators, redundancy allocation is one of the best strategies to en...
Frank Yeong-Sung Lin, Po-Hao Tsang, Kun-Dao Jiang
ENDM
2010
101views more  ENDM 2010»
15 years 1 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
SIAMJO
2002
87views more  SIAMJO 2002»
15 years 29 days ago
An Optimization Approach for Radiosurgery Treatment Planning
We outline a new approach for radiosurgery treatment planning, based on solving a series of optimization problems. We consider a specific treatment planning problem for a speciali...
Michael C. Ferris, Jinho Lim, David M. Shepard
JAIR
2010
99views more  JAIR 2010»
14 years 11 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
COCOA
2010
Springer
14 years 11 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...