New Branch-and-Cut Algorithm for Bilevel Linear Programming

Charles Audet, Gilles Savard and W. Zghal

Article (2007)

An external link is available for this item

Department:	Department of Mathematics and Industrial Engineering
Research Center:	GERAD - Research Group in Decision Analysis
PolyPublie URL:	https://publications.polymtl.ca/22286/
Journal Title:	Journal of Optimization Theory and Applications (vol. 134, no. 2)
Publisher:	Springer
DOI:	10.1007/s10957-007-9263-4
Official URL:	https://doi.org/10.1007/s10957-007-9263-4
Date Deposited:	18 Apr 2023 15:16
Last Modified:	08 Apr 2025 02:09

Cite in APA 7:	Audet, C., Savard, G., & Zghal, W. (2007). New Branch-and-Cut Algorithm for Bilevel Linear Programming. Journal of Optimization Theory and Applications, 134(2), 353-370. https://doi.org/10.1007/s10957-007-9263-4
APA 7 (HTML)ASCII CitationAtomBibTeXDOIsDublin CoreEndNote (.ENW)MARC (ISO 2709/UTF-8) (.MRC)MARC (UTF-8) (.MRK8)MARC XMLMPEG-21 DIDLMultiline CSVOAI-ORE Resource Map (Atom Format)OPENAIREOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager (.RIS)Simple Metadata

Statistics

Repository Staff Only