| Publication | Date of Publication | Type |
|---|
Convex relaxation for the generalized maximum-entropy sampling problem
Algorithmica | 2026-02-27 | Paper |
On a geometric graph-covering problem related to optimal safety-landing-site location
Discrete Applied Mathematics | 2025-12-11 | Paper |
Tridiagonal maximum-entropy sampling and tridiagonal masks
Procedia Computer Science | 2025-12-02 | Paper |
On the diameter of a 2-sum of polyhedra
Optimization Letters | 2025-11-26 | Paper |
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
Technical note -- Masking Anstreicher's Linx bound for improved entropy bounds
Operations Research | 2024-07-25 | Paper |
D-Optimal Data Fusion: Exact and Approximation Algorithms
INFORMS Journal on Computing | 2024-03-26 | Paper |
Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs
Mathematics of Operations Research | 2024-03-01 | Paper |
On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem
INFORMS Journal on Computing | 2024-02-28 | Paper |
An outer-approximation algorithm for maximum-entropy sampling
Discrete Applied Mathematics | 2024-02-27 | Paper |
| On computing sparse generalized inverses | 2023-09-19 | Paper |
| Computing D-Optimal solutions for huge-scale linear and quadratic response-surface models | 2023-09-07 | Paper |
| Branch-and-bound for integer D-Optimality with fast local search and variable-bound tightening | 2023-08-31 | Paper |
An outer-approximation algorithm for maximum-entropy sampling
Lecture Notes in Computer Science | 2023-08-03 | Paper |
Tridiagonal maximum-entropy sampling and tridiagonal masks
Discrete Applied Mathematics | 2023-06-15 | Paper |
On The Boolean Quadric Forest Polytope
INFOR: Information Systems and Operational Research | 2023-05-05 | Paper |
| Branch-and-bound for D-Optimality with fast local search and variable-bound tightening | 2023-02-14 | Paper |
| Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem | 2023-02-09 | Paper |
Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
Journal of Optimization Theory and Applications | 2023-01-23 | Paper |
Trading off \(1\)-norm and sparsity against rank for linear models using mathematical optimization: \(1\)-norm minimizing partially reflexive ah-symmetric generalized inverses
OJMO. Open Journal of Mathematical Optimization | 2022-08-20 | Paper |
Gaining or losing perspective
Journal of Global Optimization | 2022-04-11 | Paper |
| Gaining or Losing Perspective for Convex Multivariate Functions on a Simplex | 2022-01-18 | Paper |
Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
AIRO Springer Series | 2021-12-08 | Paper |
Experimental analysis of local searches for sparse reflexive generalized inverses
Journal of Global Optimization | 2021-11-26 | Paper |
Mixing convex-optimization bounds for maximum-entropy sampling
Mathematical Programming. Series A. Series B | 2021-08-11 | Paper |
Convexification of bilinear forms through non-symmetric lifting
Journal of Global Optimization | 2021-08-11 | Paper |
Approximate 1-norm minimization and minimum-rank structured sparsity for various generalized inverses via local search
SIAM Journal on Optimization | 2021-07-20 | Paper |
| Masking Anstreicher's linx bound for improved entropy bounds | 2021-06-05 | Paper |
| Handling separable non-convexities using disjunctive cuts | 2021-02-04 | Paper |
Improving proximity bounds using sparsity
(available as arXiv preprint) | 2021-02-04 | Paper |
On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs
Optimization Letters | 2020-04-27 | Paper |
On an SDP relaxation for kissing number
Optimization Letters | 2020-04-27 | Paper |
Volume computation for sparse Boolean quadric relaxations
Discrete Applied Mathematics | 2020-02-20 | Paper |
Approximating max-cut under graph-MSO constraints
Operations Research Letters | 2020-02-10 | Paper |
On sparse reflexive generalized inverse
Operations Research Letters | 2020-02-10 | Paper |
On Proximity for k-Regular Mixed-Integer Linear Optimization
Advances in Intelligent Systems and Computing | 2020-02-07 | Paper |
Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization
Optimization and Engineering | 2019-10-29 | Paper |
More Virtuous Smoothing
SIAM Journal on Optimization | 2019-05-07 | Paper |
Continuous relaxations for Constrained Maximum-Entropy Sampling
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
Journal of Global Optimization | 2018-12-21 | Paper |
Approximating graph-constrained max-cut
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
Mathematical Programming. Series A. Series B | 2018-07-13 | Paper |
Computing with an algebraic-perturbation variant of Barvinok's algorithm
Discrete Applied Mathematics | 2018-04-04 | Paper |
On global optimization with indefinite quadratics
EURO Journal on Computational Optimization | 2018-03-28 | Paper |
| Efficient treatment of bilinear forms in global optimization | 2018-03-20 | Paper |
Quantifying double McCormick
Mathematics of Operations Research | 2017-12-07 | Paper |
Virtuous smoothing for global optimization
Journal of Global Optimization | 2017-12-07 | Paper |
Experimental validation of volume-based comparison for double-McCormick relaxations
(available as arXiv preprint) | 2017-08-04 | Paper |
Extended formulations for independence polytopes of regular matroids
Graphs and Combinatorics | 2016-11-29 | Paper |
An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space
International Transactions in Operational Research | 2016-10-21 | Paper |
| An algebraic-perturbation variant of Barvinok's algorithm | 2016-10-17 | Paper |
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space
Computational Optimization and Applications | 2016-09-26 | Paper |
Max-cut under graph constraints
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
| Sparse pseudoinverses via LP and SDP relaxations of Moore-Penrose | 2016-06-22 | Paper |
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
SIAM Journal on Optimization | 2015-12-11 | Paper |
Weak orientability of matroids and polynomial equations
European Journal of Combinatorics | 2015-08-19 | Paper |
On the Composition of Convex Envelopes for Quadrilinear Terms
Optimization, Simulation, and Control | 2015-03-30 | Paper |
On branching rules for convex mixed-integer nonlinear optimization
ACM Journal of Experimental Algorithmics | 2015-03-16 | Paper |
Non-monotone submodular maximization under matroid and knapsack constraints
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Optimal rank-sparsity decomposition
Journal of Global Optimization | 2015-01-15 | Paper |
On the optimal design of water distribution networks: a practical MINLP approach
Optimization and Engineering | 2014-08-20 | Paper |
Matroid matching: the power of local search
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
On the number of realizations of certain Henneberg graphs arising in protein conformation
Discrete Applied Mathematics | 2014-05-05 | Paper |
Computation in multicriteria matroid optimization
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Techniques for submodular maximization
Discrete Geometry and Optimization | 2013-09-13 | Paper |
Matroid matching: the power of local search
SIAM Journal on Computing | 2013-07-04 | Paper |
A matroid view of key theorems for edge-swapping algorithms
Mathematical Methods of Operations Research | 2013-02-20 | Paper |
The quadratic Graver cone, quadratic integer minimization, and extensions
Mathematical Programming. Series A. Series B | 2012-12-19 | Paper |
Discretization orders for distance geometry problems
Optimization Letters | 2012-11-30 | Paper |
A polytope for a product of real linear functions in 0/1 variables
Mixed Integer Nonlinear Programming | 2012-07-10 | Paper |
An algorithmic framework for MINLP with separable non-convexity
Mixed Integer Nonlinear Programming | 2012-07-10 | Paper |
On a binary-encoded ILP coloring formulation
INFORMS Journal on Computing | 2012-06-18 | Paper |
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
Mathematical Programming. Series A. Series B | 2011-12-14 | Paper |
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
Journal of Symbolic Computation | 2011-12-07 | Paper |
On the number of solutions of the discretizable molecular distance geometry problem
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
A probing algorithm for MINLP with failure prediction by SVM
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2011-05-26 | Paper |
Intractability of approximate multi-dimensional nonlinear optimization on independence systems
Discrete Mathematics | 2011-05-06 | Paper |
Submodular maximization over multiple matroids via generalized exchange properties
Mathematics of Operations Research | 2011-04-27 | Paper |
Feasibility-based bounds tightening via fixed points
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Maximizing nonmonotone submodular functions under matroid or knapsack constraints
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Approximate nonlinear optimization over weighted independence systems
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization
Mathematical Programming Computation | 2010-10-14 | Paper |
On convex relaxations of quadrilinear terms
Journal of Global Optimization | 2010-10-06 | Paper |
Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Parametric nonlinear discrete optimization over well-described sets and matroid intersections
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Nonlinear integer programming
50 Years of Integer Programming 1958-2008 | 2010-06-03 | Paper |
Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz – Corrigendum
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Expressing combinatorial problems by systems of polynomial equations and Hilbert's Nullstellensatz
Combinatorics, Probability and Computing | 2010-04-22 | Paper |
A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Branching and bounds tighteningtechniques for non-convex MINLP
Optimization Methods & Software | 2009-09-18 | Paper |
Nonlinear Matroid Optimization and Experimental Design
SIAM Journal on Discrete Mathematics | 2009-08-20 | Paper |
Nonlinear Optimization over a Weighted Independence System
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
On test sets for nonlinear integer maximization
Operations Research Letters | 2009-03-04 | Paper |
Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility
(available as arXiv preprint) | 2009-01-20 | Paper |
An algorithmic framework for convex mixed integer nonlinear programs
Discrete Optimization | 2008-10-29 | Paper |
| Nonlinear optimization for matroid intersection and extensions | 2008-07-24 | Paper |
Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
An MINLP Solution Method for a Water Network Problem
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Comparison of the Two Formulations of w-u-v and w-F in Nonlinear Plate Analysis
Journal of Applied Mechanics | 2007-06-01 | Paper |
Solving maximum-entropy sampling problems using factored masks
Mathematical Programming. Series A. Series B | 2007-03-05 | Paper |
In situ column generation for a cutting-stock problem
Computers & Operations Research | 2007-02-26 | Paper |
Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
Annals of Operations Research | 2006-03-07 | Paper |
Parsimonious binary-encoding in integer programming
Discrete Optimization | 2006-01-09 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Min-up/min-down polytopes
Discrete Optimization | 2005-08-22 | Paper |
Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation
Journal of Combinatorial Optimization | 2005-05-17 | Paper |
| scientific article; zbMATH DE number 2107839 (Why is no real title available?) | 2004-10-13 | Paper |
A linear integer programming bound for maximum-entropy sampling
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
| scientific article; zbMATH DE number 1985302 (Why is no real title available?) | 2003-09-24 | Paper |
Cropped cubes
Journal of Combinatorial Optimization | 2003-08-28 | Paper |
Constrained maximum-entropy sampling
Operations Research | 2003-05-05 | Paper |
All-different polytopes
Journal of Combinatorial Optimization | 2002-08-20 | Paper |
Maximum-entropy remote sampling
Discrete Applied Mathematics | 2001-06-19 | Paper |
Polyhedral methods for piecewise-linear functions. I: The lambda method
Discrete Applied Mathematics | 2001-06-14 | Paper |
Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
Mathematical Programming. Series A. Series B | 2001-02-09 | Paper |
A characterization of the orientations of ternary matroids
Journal of Combinatorial Theory. Series B | 2000-06-25 | Paper |
Orienting matroids representable over both GF(3) and GF(5)
European Journal of Combinatorics | 2000-06-04 | Paper |
| scientific article; zbMATH DE number 1301934 (Why is no real title available?) | 1999-10-17 | Paper |
On the Boolean-quadric packing uncapacitated facility-location polytope
Annals of Operations Research | 1999-05-05 | Paper |
The volume of relaxed Boolean-quadric and cut polytopes
Discrete Mathematics | 1997-06-09 | Paper |
Classroom Note:Hoffman's Circle Untangled
SIAM Review | 1997-05-19 | Paper |
An Exact Algorithm for Maximum Entropy Sampling
Operations Research | 1997-03-11 | Paper |
Block matrices and multispherical structure of distance matrices
Linear Algebra and its Applications | 1997-02-11 | Paper |
More facets from fences for linear ordering and acyclic subgraph polytopes
Discrete Applied Mathematics | 1995-08-01 | Paper |
Geometric comparison of combinatorial polytopes
Discrete Applied Mathematics | 1994-12-01 | Paper |
Local bipartite turán graphs and graph partitioning
Networks | 1994-05-10 | Paper |
Order selection on a single machine with high set-up costs
Annals of Operations Research | 1993-12-20 | Paper |
A comparison of two edge-coloring formulations
Operations Research Letters | 1993-11-28 | Paper |
Classification of two-person ordinal bimatrix games
International Journal of Game Theory | 1993-02-14 | Paper |
On Constrained Bottleneck Extrema
Operations Research | 1993-01-17 | Paper |
Crashing a maximum-weight complementary basis
Mathematical Programming. Series A. Series B | 1993-01-16 | Paper |
Matroid Applications and Algorithms
ORSA Journal on Computing | 1992-08-13 | Paper |
A spectral method for concordant polyhedral faces
Linear Algebra and its Applications | 1992-06-27 | Paper |
The incidence structure of subspaces with well-scaled frames
Journal of Combinatorial Theory. Series B | 1990-01-01 | Paper |
A spectral approach to polyhedral dimension
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
Characterizations of the Dimension for Classes of Concordant Polytopes
Mathematics of Operations Research | 1990-01-01 | Paper |
Canonical equation sets for classes of concordant polytopes
Discrete Applied Mathematics | 1990-01-01 | Paper |
Subspaces with well-scaled frames
Linear Algebra and its Applications | 1989-01-01 | Paper |
Turán's triangle theorem and binary matroids
European Journal of Combinatorics | 1989-01-01 | Paper |
Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem
(available as arXiv preprint) | N/A | Paper |
On the Diameter of a 2-Sum of Polyhedra
(available as arXiv preprint) | N/A | Paper |
Good and Fast Row-Sparse ah-Symmetric Reflexive Generalized Inverses
(available as arXiv preprint) | N/A | Paper |
On the Hardness of Short and Sign-Compatible Circuit Walks
(available as arXiv preprint) | N/A | Paper |
Gaining or losing perspective for convex multivariate functions on box domains
(available as arXiv preprint) | N/A | Paper |
