FilMINT : an outer approximation-based solver for convex mixed-integer nonlinear programs

von Abhishek, Kumar
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2010)

Locally ideal formulations for piecewise linear functions with indicator variables

von Sridhar, Srikrishna
Veröffentlicht in Operations research letters (2013)

Improving bounds on the football pool problem by integer programming and high-throughput computing

von Linderoth, Jeff
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2009)

On the Complexity of Separation from the Knapsack Polytope

von Pia, Alberto Del
Veröffentlicht in IPCO (23. : 2022 : Eindhoven) Integer programming and combinatorial optimization (2022)

Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets

von Pia, Alberto Del
Veröffentlicht in IPCO (22. : 2021 : Online) Integer programming and combinatorial optimization (2021)

New Classes of Facets for Complementarity Knapsack Problems

von Pia, Alberto Del
Veröffentlicht in ISCO (7. : 2022 : Online) Combinatorial optimization (2022)

Solving large Steiner Triple Covering Problems

Veröffentlicht in Operations research letters (2011)

Integer packing sets form a well-quasi-ordering

von Del Pia, Alberto
Veröffentlicht in Operations research letters (2021)

Piecewise polyhedral formulations for a multilinear term

von Sundar, Kaarthik
Veröffentlicht in Operations research letters (2021)

A cycle-based fomulation and valid inequalities for DC power transmission problems with switching

von Kocuk, Burak
Veröffentlicht in Operations research (-2016)

The Mathematical Foundations of Epistemic Network Analysis

von Bowman, Dale
Veröffentlicht in ICQE (2. : 2021 : Online) Advances in quantitative ethnography (2021)