41 search results - page 2 / 9 » On Using Cutting Planes in Pseudo-Boolean Optimization |
EOR
2010
13 years 2 months ago
2010
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
MANSCI
2008
13 years 5 months ago
2008
We consider the problem of minimizing staffing costs in an inbound call center, while maintaining an acceptable level of service in multiple time periods. The problem is complicat...
IOR
2011
13 years 6 days ago
2011
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
CC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Recent work has shown that the subtasks of register allocation (spilling, register assignment, and coalescing) can be completely separated. This work presents an algorith...
ICCAD
2002
IEEE
14 years 2 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...