Sciweavers

11 search results - page 1 / 3
» On the Value of Binary Expansions for General Mixed-Integer ...
Sort
View
41
Voted
IOR
2002
45views more  IOR 2002»
14 years 11 months ago
On the Value of Binary Expansions for General Mixed-Integer Linear Programs
Jonathan H. Owen, Sanjay Mehrotra
92
Voted
IOR
2006
177views more  IOR 2006»
14 years 11 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
104
Voted
SIAMJO
2010
135views more  SIAMJO 2010»
14 years 10 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs
PSD
2010
Springer
109views Database» more  PSD 2010»
14 years 10 months ago
A Tool for Analyzing and Fixing Infeasible RCTA Instances
Minimum-distance controlled tabular adjustment methods (CTA), and its restricted variants (RCTA), is a recent perturbative approach for tabular data protection. Given a table to be...
Jordi Castro, José A. González
COCOON
2008
Springer
15 years 1 months ago
A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constrai
When a switching network topology is used for constructing optical cross-connects, as in the circuit switching case, no two routes are allowed to share a link. However, if two rou...
Hung Q. Ngo, Yang Wang 0014, Anh Le