Back to Results
First PageMeta Content
Applied mathematics / Convex optimization / Linear programming / Cutting-plane method / Bilevel program / Inequality / Expected value / Operations research / Mathematics / Mathematical optimization


Bilevel Programming and Maximally Violated Valid Inequalities Andrea Lodi∗ , Ted K. Ralphs◦ ∗ DEIS, University of Bologna
Add to Reading List

Document Date: 2010-06-19 14:25:52

Open Document

File Size: 162,33 KB

Share Result on Facebook

Company

Princeton University Press / McCormick / bilevel LP / /

Currency

pence / /

/

Facility

University of Bologna Viale Risorgimento / Systems Engineering Lehigh University / /

IndustryTerm

transportation / separation algorithms / feasible solution / branch-and-cut algorithms / feasible solutions / /

Organization

University of Bologna Viale Risorgimento / Princeton University / Lehigh University / Department of Industrial / /

Person

R. E. Bixby / V / Andrea Lodi / max b / Leo Liberti / Ted K. Ralphs / /

/

Position

Salesman / Traveling Salesman / /

ProgrammingLanguage

RC / E / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

branch-and-cut algorithms / separation algorithms / /

SocialTag