Jon Lee

SIAM J. Discret. Math., March, 2024

2023

Tridiagonal maximum-entropy sampling and tridiagonal masks.

[BibT_eX]

[DOI]

Hessa Al-Thani

Discret. Appl. Math., October, 2023

Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2023

Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem.

[BibT_eX]

[DOI]

Zhongzhu Chen

Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022

Gaining or losing perspective.

[BibT_eX]

[DOI]

J. Glob. Optim., 2022

Preface: Combinatorial Optimization ISCO 2018.

[BibT_eX]

[DOI]

Ali Ridha Mahjoub

Giovanni Rinaldi

Discret. Appl. Math., 2022

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.

[BibT_eX]

[DOI]

CoRR, 2022

An Outer-Approximation Algorithm for Maximum-Entropy Sampling.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021

Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search.

[BibT_eX]

[DOI]

SIAM J. Optim., 2021

Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses.

[BibT_eX]

[DOI]

Gabriel Ponte

Open J. Math. Optim., 2021

Mixing convex-optimization bounds for maximum-entropy sampling.

[BibT_eX]

[DOI]

Math. Program., 2021

Experimental analysis of local searches for sparse reflexive generalized inverses.

[BibT_eX]

[DOI]

J. Glob. Optim., 2021

Convexification of bilinear forms through non-symmetric lifting.

[BibT_eX]

[DOI]

J. Glob. Optim., 2021

Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2021

2020

An R Package for Generating Covariance Matrices for Maximum-Entropy Sampling from Precipitation Chemistry Data.

[BibT_eX]

[DOI]

Hessa Al-Thani

Oper. Res. Forum, 2020

On an SDP relaxation for kissing number.

[BibT_eX]

[DOI]

Leo Liberti

Optim. Lett., 2020

On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs.

[BibT_eX]

[DOI]

Optim. Lett., 2020

Generalized maximum-entropy sampling.

[BibT_eX]

[DOI]

Joy Lind

INFOR Inf. Syst. Oper. Res., 2020

Correction to: Extended Formulations for Independence Polytopes of Regular Matroids.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Volume computation for sparse Boolean quadric relaxations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Improving Proximity Bounds Using Sparsity.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

Handling Separable Non-convexities Using Disjunctive Cuts.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

More Virtuous Smoothing.

[BibT_eX]

[DOI]

Luze Xu

SIAM J. Optim., 2019

On Proximity for k-Regular Mixed-Integer Linear Optimization.

[BibT_eX]

[DOI]

Luze Xu

Proceedings of the Optimization of Complex Systems: Theory, 2019

Diving for Sparse Partially-Reflexive Generalized Inverses.

[BibT_eX]

[DOI]

Victor K. Fuentes

Proceedings of the Optimization of Complex Systems: Theory, 2019

2018

Approximating max-cut under graph-MSO constraints.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2018

On sparse reflexive generalized inverse.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2018

Approximating graph-constrained max-cut.

[BibT_eX]

[DOI]

Xiangkun Shen

Viswanath Nagarajan

Math. Program., 2018

Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations.

[BibT_eX]

[DOI]

Math. Program., 2018

On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation.

[BibT_eX]

[DOI]

J. Glob. Optim., 2018

Computing with an algebraic-perturbation variant of Barvinok's algorithm.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

On Sparse Reflexive Generalized Inverses.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Another pedagogy for pure-integer Gomory.

[BibT_eX]

[DOI]

Qi He

RAIRO Oper. Res., 2017

Quantifying Double McCormick.

[BibT_eX]

[DOI]

Math. Oper. Res., 2017

Virtuous smoothing for global optimization.

[BibT_eX]

[DOI]

J. Glob. Optim., 2017

Another pedagogy for mixed-integer Gomory.

[BibT_eX]

[DOI]

Angelika Wiegele

EURO J. Comput. Optim., 2017

On global optimization with indefinite quadratics.

[BibT_eX]

[DOI]

Wendel Melo

EURO J. Comput. Optim., 2017

Experimental Validation of Volume-Based Comparison for Double-McCormick Relaxations.

[BibT_eX]

[DOI]

Han Yu

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016

An overview of exact algorithms for the Euclidean Steiner tree problem in <i>n</i>-space.

[BibT_eX]

[DOI]

Nelson Maculan

Int. Trans. Oper. Res., 2016

Extended Formulations for Independence Polytopes of Regular Matroids.

[BibT_eX]

[DOI]

Graphs Comb., 2016

A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in <i>n</i>-space.

[BibT_eX]

[DOI]

Wendel Melo

Comput. Optim. Appl., 2016

Low-Rank/Sparse-Inverse Decomposition via Woodbury.

[BibT_eX]

[DOI]

Victor K. Fuentes

Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

Max-Cut Under Graph Constraints.

[BibT_eX]

[DOI]

Viswanath Nagarajan

Xiangkun Shen

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2015

On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond.

[BibT_eX]

[DOI]

Jesús A. De Loera

Raymond Hemmecke

SIAM J. Optim., 2015

Preface.

[BibT_eX]

[DOI]

Jens Vygen

Math. Program., 2015

An algebraic-perturbation variant of Barvinok's algorithm.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Weak orientability of matroids and polynomial equations.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers.

[BibT_eX]

[DOI]

Andrew Orso

Siqian Shen

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

2014

Optimal rank-sparsity decomposition.

[BibT_eX]

[DOI]

Bai Zou

J. Glob. Optim., 2014

On the number of realizations of certain Henneberg graphs arising in protein conformation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

Matroid Matching: The Power of Local Search.

[BibT_eX]

[DOI]

Maxim Sviridenko

Jan Vondrák

SIAM J. Comput., 2013

On branching rules for convex mixed-integer nonlinear optimization.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2013

Optimizing the Assignment of Students to Classes in an Elementary School.

[BibT_eX]

[DOI]

Binyamin Krauss

Daniel Newman

INFORMS Trans. Educ., 2013

Systems of Polynomials for Detecting Orientable Matroids.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

2012

Discretization orders for distance geometry problems.

[BibT_eX]

[DOI]

Optim. Lett., 2012

The quadratic Graver cone, quadratic integer minimization, and extensions.

[BibT_eX]

[DOI]

Math. Program., 2012

A matroid view of key theorems for edge-swapping algorithms.

[BibT_eX]

[DOI]

Leo Liberti

Math. Methods Oper. Res., 2012

2011

Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations.

[BibT_eX]

[DOI]

Anureet Saxena

Pierre Bonami

Math. Program., 2011

Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz.

[BibT_eX]

[DOI]

J. Symb. Comput., 2011

A Probing Algorithm for MINLP with Failure Prediction by SVM.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization.

[BibT_eX]

[DOI]

John A. Gunnels

Susan Margulies

Math. Program. Comput., 2010

Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations.

[BibT_eX]

[DOI]

Anureet Saxena

Pierre Bonami

Math. Program., 2010

Parametric nonlinear discrete optimization over well-described sets and matroid intersections.

[BibT_eX]

[DOI]

Math. Program., 2010

Submodular Maximization over Multiple Matroids via Generalized Exchange Properties.

[BibT_eX]

[DOI]

Maxim Sviridenko

Jan Vondrák

Math. Oper. Res., 2010

On convex relaxations of quadrilinear terms.

[BibT_eX]

[DOI]

Sonia Cafieri

Leo Liberti

J. Glob. Optim., 2010

Intractability of approximate multi-dimensional nonlinear optimization on independence systems.

[BibT_eX]

[DOI]

CoRR, 2010

On the Convergence of Feasibility based Bounds Tightening.

[BibT_eX]

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

Feasibility-Based Bounds Tightening via Fixed Points.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2010

Nonlinear Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009

Approximate Nonlinear Optimization over Weighted Independence Systems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Branching and bounds tighteningtechniques for non-convex MINLP.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2009

Computation in multicriteria matroid optimization.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

Non-monotone submodular maximization under matroid and knapsack constraints.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity.

[BibT_eX]

[DOI]

Claudia D'Ambrosio

Andreas Wächter

Proceedings of the Algorithms, 2009

On the Boundary of Tractability for Nonlinear Discrete Optimization.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Nonlinear Optimization over a Weighted Independence System.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

Nonlinear Matroid Optimization and Experimental Design.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

On test sets for nonlinear integer maximization.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

An algorithmic framework for convex mixed integer nonlinear programs.

[BibT_eX]

[DOI]

Discret. Optim., 2008

Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs.

[BibT_eX]

[DOI]

Anureet Saxena

Pierre Bonami

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007

Solving maximum-entropy sampling problems using factored masks.

[BibT_eX]

[DOI]

Samuel Burer

Math. Program., 2007

On a Binary-Encoded ILP Coloring Formulation.

[BibT_eX]

[DOI]

François Margot

INFORMS J. Comput., 2007

Mixed-integer nonlinear programming: Some modeling and solution issues.

[BibT_eX]

[DOI]

IBM J. Res. Dev., 2007

Mixed integer programming.

[BibT_eX]

[DOI]

Adam N. Letchford

Discret. Optim., 2007

In situ column generation for a cutting-stock problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2007

2006

Using AMPL for Teaching the TSP.

[BibT_eX]

[DOI]

John F. Raffensperger

INFORMS Trans. Educ., 2006

An MINLP Solution Method for a Water Network Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

2005

Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation.

[BibT_eX]

[DOI]

Sven de Vries

J. Comb. Optim., 2005

Parsimonious binary-encoding in integer programming.

[BibT_eX]

[DOI]

Don Coppersmith

Discret. Optim., 2005

Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem.

[BibT_eX]

[DOI]

Laszlo Ladányi

Robin Lougee-Heimer

Ann. Oper. Res., 2005

2004

Min-up/min-down polytopes.

[BibT_eX]

[DOI]

François Margot

Discret. Optim., 2004

More on a Binary-Encoded Coloring Formulation.

[BibT_eX]

[DOI]

François Margot

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003

A linear integer programming bound for maximum-entropy sampling.

[BibT_eX]

[DOI]

Joy Williams

Math. Program., 2003

Cropped Cubes.

[BibT_eX]

[DOI]

J. Comb. Optim., 2003

2002

All-Different Polytopes.

[BibT_eX]

[DOI]

J. Comb. Optim., 2002

2001

Polyhedral methods for piecewise-linear functions I: the lambda method.

[BibT_eX]

[DOI]

Dan Wilson

Discret. Appl. Math., 2001

Maximum-entropy remote sampling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

Evaluating multiple attribute items using queries.

[BibT_eX]

[DOI]

Vijay S. Iyengar

Murray Campbell

Proceedings of the Proceedings 3rd ACM Conference on Electronic Commerce (EC-2001), 2001

1999

Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems.

[BibT_eX]

[DOI]

Math. Program., 1999

A Characterization of the Orientations of Ternary Matroids.

[BibT_eX]

[DOI]

Matt Scobee

J. Comb. Theory, Ser. B, 1999

Orienting Matroids Representable Over Both GF(3) and GF(5).

[BibT_eX]

[DOI]

Eur. J. Comb., 1999

1998

Constrained Maximum-Entropy Sampling.

[BibT_eX]

[DOI]

Oper. Res., 1998

On the boolean-quadric packinguncapacitated facility-location polytope.

[BibT_eX]

[DOI]

Jill Hardin

Ann. Oper. Res., 1998

1997

Classroom Note: Hoffman's Circle Untangled.

[BibT_eX]

[DOI]

SIAM Rev., 1997

The volume of relaxed Boolean-quadric and cut polytopes.

[BibT_eX]

[DOI]

Chun-Wa Ko

Einar Steingrímsson

Discret. Math., 1997

1996

Continuous Relaxations for Constrained Maximum-Entropy Sampling.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

An Exact Algorithm for Maximum Entropy Sampling.

[BibT_eX]

[DOI]

Chun-Wa Ko

Maurice Queyranne

Oper. Res., 1995

1994

Local bipartite turán graphs and graph partitioning.

[BibT_eX]

[DOI]

Jennifer Ryan

Networks, 1994

More facets from fences for linear ordering and acyclic subgraph polytopes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Geometric Comparison of Combinatorial Polytopes.

[BibT_eX]

[DOI]

Walter D. Morris Jr.

Discret. Appl. Math., 1994

1993

A comparison of two edge-coloring formulations.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1993

Order selection on a single machine with high set-up costs.

[BibT_eX]

[DOI]

Brenda L. Dietrich

Yew Sing Lee

Ann. Oper. Res., 1993

1992

Crashing a maximum-weight complementary basis.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Thomas F. Rutherford

Math. Program., 1992

On Constrained Bottleneck Extrema.

[BibT_eX]

[DOI]

Oper. Res., 1992

Matroid Applications and Algorithms.

[BibT_eX]

[DOI]

Jennifer Ryan

INFORMS J. Comput., 1992

1990

A Spectral Approach to Polyhedral Dimension.

[BibT_eX]

[DOI]

Math. Program., 1990

Characterizations of the Dimension for Classes of Concordant Polytopes.

[BibT_eX]

[DOI]

Math. Oper. Res., 1990

The incidence structure of subspaces with well-scaled frames.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1990

Canonical equation sets for classes of concordant polytopes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

1989

Turán's Triangle Theorem and Binary Matroids.

[BibT_eX]

[DOI]