51

New inequalities for the General Routing Problem

Year:
1997
Language:
english
File:
PDF, 349 KB
english, 1997
52

The general routing polyhedron: A unifying framework

Year:
1999
Language:
english
File:
PDF, 253 KB
english, 1999
53

On Disjunctive Cuts for Combinatorial Optimization

Year:
2001
Language:
english
File:
PDF, 120 KB
english, 2001
56

On the membership problem for the -closure

Year:
2011
Language:
english
File:
PDF, 229 KB
english, 2011
59

Unbounded convex sets for non-convex mixed-integer quadratic programming

Year:
2014
Language:
english
File:
PDF, 369 KB
english, 2014
60

A polyhedral approach to the single row facility layout problem

Year:
2013
Language:
english
File:
PDF, 307 KB
english, 2013
62

Allocation of School Bus Contracts by Integer Programming

Year:
1996
Language:
english
File:
PDF, 151 KB
english, 1996
63

A new separation algorithm for the Boolean quadric and cut polytopes

Year:
2014
Language:
english
File:
PDF, 431 KB
english, 2014
70

Separating a Superclass of Comb Inequalities in Planar Graphs

Year:
2000
Language:
english
File:
PDF, 647 KB
english, 2000
73

Separating a Superclass of Comb Inequalities in Planar Graphs

Year:
2000
Language:
english
File:
PDF, 164 KB
english, 2000
75

-partition problem

Year:
2017
Language:
english
File:
PDF, 770 KB
english, 2017
78

A note on the 2-circulant inequalities for the max-cut problem

Year:
2018
Language:
english
File:
PDF, 351 KB
english, 2018
79

penalty

Year:
2018
Language:
english
File:
PDF, 1.22 MB
english, 2018
80

A guide to conic optimisation and its applications

Year:
2018
Language:
english
File:
PDF, 595 KB
english, 2018
82

A heuristic for fair dynamic resource allocation in overloaded OFDMA systems

Year:
2019
Language:
english
File:
PDF, 270 KB
english, 2019
85

Facets from gadgets

Year:
2019
File:
PDF, 399 KB
2019