Bilevel Programming and the Separation Problem Andrea Lodi DEIS, University of Bologna, Italy Ted K. Ralphs - University of Bologna - Document - PDFSEARCH.IO

First Page	Meta Content
	Bilevel Programming and the Separation Problem Andrea Lodi DEIS, University of Bologna, Italy Ted K. Ralphs Add to Reading List Document Date: 2016-03-26 12:56:25 Open Document File Size: 456,82 KB Share Result on Facebook Company bilevel LP / Proposition 1 The bilevel LP / / Country United States / Netherlands / Italy / / Currency pence / / / Facility University of Bologna / Lehigh University / / IndustryTerm trivial solution / separation algorithms / feasible solution / branch-and-cut algorithms / feasible solutions / / Organization Department of Mathematics and Computer Science / Lehigh University / University of Bologna / National Science Foundation / Italy Ted K. Ralphs Department / USA Gerhard J. Woeginger Department of Mathematics and Computer Science / / Person Ted K. Ralphs / Andrea Lodi / Gerhard J. Woeginger / / Position even player / player / / ProgrammingLanguage TSP / L / / Technology branch-and-cut algorithms / separation algorithms / / SocialTag Mathematical optimization Operations research Structural complexity theory Computational problems Computational complexity theory Linear programming Cutting-plane method Bilevel program NP Theoretical computer science

Bilevel Programming and the Separation Problem Andrea Lodi DEIS, University of Bologna, Italy Ted K. RalphsAdd to Reading List