C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
On the path-width of integer linear programming.
Constantin Enea
Peter Habermehl
Omar Inverso
Gennaro Parlato
Published in:
Inf. Comput. (2017)
Keyphrases
</>
integer linear programming
bicriteria
column generation
linear inequalities
boolean satisfiability
shortest path
symmetry breaking
global constraints
boolean optimization
lower bound
cost function
dynamic programming
heuristic search
minimum cost
cutting plane