Non-linear Integer Programming

Organizers: Martin Grötschel and Thorsten Koch

Ord.	Authors	Title
1	M. Armbruster M. Fügenschuh C. Helmberg A. Martin	A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
2	P. Belotti J. Lee L. Liberti F. Margot A. Waechter	Branching Techniques and Valid Linear Inequalities for Mixed-Integer Nonconvex Programming
3	R. Borndörfer C. Cardonha	A Non-linear Approach to the Vehicle Positioning Problem
4	B. Geißler A. Martin A. Morsi	Solving Dynamic Network Problems by MIP Techniques
5	T. Koch S. Vigerske	Extending SCIP to Solve Quadratic MINLPs
6	D. Li X. Sun C. Liu	Geometric Properties and Optimality Conditions of Quadratic Binary Programming
7	X. L. Sun X. J. Zheng D. Li	Semidefinite Programming Relaxation for Constrained 0-1 Quadratic Programs

Minisymposium