Sciweavers

273 search results - page 1 / 55
» Can Pure Cutting Plane Algorithms Work
Sort
View
IPCO
2008
105views Optimization» more  IPCO 2008»
13 years 5 months ago
Can Pure Cutting Plane Algorithms Work?
We discuss an implementation of the lexicographic version of Gomory's fractional cutting plane method and of two heuristics mimicking the latter. In computational testing on a...
Arrigo Zanette, Matteo Fischetti, Egon Balas
CC
2007
Springer
107views System Software» more  CC 2007»
13 years 9 months ago
A Fast Cutting-Plane Algorithm for Optimal Coalescing
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...
Daniel Grund, Sebastian Hack
EOR
2010
140views more  EOR 2010»
13 years 29 days ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: 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...
Osman Oguz
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 3 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
JSAT
2006
88views more  JSAT 2006»
13 years 3 months ago
On Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
Vasco M. Manquinho, João P. Marques Silva