Sciweavers

189 search results - page 1 / 38
» A generalization of the integer linear infeasibility problem
Sort
View
DISOPT
2008
61views more  DISOPT 2008»
13 years 4 months ago
A generalization of the integer linear infeasibility problem
Akimichi Takemura, Ruriko Yoshida
PSD
2010
Springer
109views Database» more  PSD 2010»
13 years 3 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
ICALP
2001
Springer
13 years 9 months ago
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that for any monotone system of r linear inequaliti...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
IOR
2006
177views more  IOR 2006»
13 years 4 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
CORR
2011
Springer
220views Education» more  CORR 2011»
12 years 11 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers