Robert Hildebrand

Laurel Travis

J. Optim. Theory Appl., September, 2024

Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II.

[BibT_eX]

[DOI]

Comput. Optim. Appl., April, 2024

Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I.

[BibT_eX]

[DOI]

Comput. Optim. Appl., April, 2024

Algorithms for Finding the Best Pure Nash Equilibrium in Edge-weighted Budgeted Maximum Coverage Games.

[BibT_eX]

[DOI]

Hyunwoo Lee

Wenbo Cai

I. Esra Büyüktahtakin

CoRR, 2024

Job Shop Scheduling with Integer Programming, Shifting Bottleneck, and Decision Diagrams: A Computational Study.

[BibT_eX]

[DOI]

Brannon King

Proceedings of the Communication Papers of the 19th Conference on Computer Science and Intelligence Systems, 2024

2023

Complexity, exactness, and rationality in polynomial optimization.

[BibT_eX]

[DOI]

Daniel Bienstock

Alberto Del Pia

Math. Program., February, 2023

2022

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. VII. Inverse Semigroup Theory, Closures, Decomposition of Perturbations.

[BibT_eX]

[DOI]

Yuan Zhou

Open J. Math. Optim., March, 2022

Compact mixed-integer programming formulations in quadratic optimization.

[BibT_eX]

[DOI]

Benjamin Beach

Joey Huchette

J. Glob. Optim., 2022

An Autonomous Task Assignment Paradigm for Autonomous Robotic In-Space Assembly.

[BibT_eX]

[DOI]

Frontiers Robotics AI, 2022

2020

A Flexible Job Shop Scheduling Representation of the Autonomous In-Space Assembly Task Assignment Problem.

[BibT_eX]

[DOI]

CoRR, 2020

An approximate method for the optimization of long-Horizon tank blending and scheduling operations.

[BibT_eX]

[DOI]

Comput. Chem. Eng., 2020

2019

On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem.

[BibT_eX]

[DOI]

Yuan Zhou

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018

Sublinear Bounds for a Quantitative Doignon-Bell-Scarf Theorem.

[BibT_eX]

[DOI]

Stephen R. Chestnut

Rico Zenklusen

SIAM J. Discret. Math., 2018

Binary extended formulations of polyhedral mixed-integer sets.

[BibT_eX]

[DOI]

Sanjeeb Dash

Oktay Günlük

Math. Program., 2018

Minimal cut-generating functions are nearly extreme.

[BibT_eX]

[DOI]

Marco Molinaro

Math. Program., 2018

Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix.

[BibT_eX]

[DOI]

Math. Program., 2018

2017

Equivariant perturbation in Gomory and Johnson's infinite group problem - III: foundations for the k-dimensional case with applications to k=2.

[BibT_eX]

[DOI]

Math. Program., 2017

Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations.

[BibT_eX]

[DOI]

Robert Weismantel

Rico Zenklusen

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane.

[BibT_eX]

[DOI]

Math. Oper. Res., 2016

Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms.

[BibT_eX]

[DOI]

4OR, 2016

Light on the infinite group relaxation I: foundations and taxonomy.

[BibT_eX]

[DOI]

4OR, 2016

An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra.

[BibT_eX]

[DOI]

Robert Weismantel

Kevin Zemmer

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Note on the complexity of the mixed-integer hull of a polyhedron.

[BibT_eX]

[DOI]

Timm Oertel

Robert Weismantel

Oper. Res. Lett., 2015

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case.

[BibT_eX]

[DOI]

Math. Oper. Res., 2015

2014

The triangle closure is a polyhedron.

[BibT_eX]

[DOI]

Math. Program., 2014

Light on the Infinite Group Relaxation.

[BibT_eX]

[DOI]

CoRR, 2014

2013

A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation.

[BibT_eX]

[DOI]

SIAM J. Optim., 2013

A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn).

[BibT_eX]

[DOI]

Discret. Optim., 2013

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2011

Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets

[BibT_eX]

[DOI]

CoRR, 2011

2010

A Faster Algorithm for Quasi-convex Integer Polynomial Optimization

[BibT_eX]

[DOI]