Jeff T. Linderoth

Math. Program., February, 2023

2022

The hierarchical organization of autocatalytic reaction networks and its relevance to the origin of life.

[BibT_eX]

[DOI]

Zhen Peng

David A. Baum

PLoS Comput. Biol., September, 2022

New Classes of Facets for Complementarity Knapsack Problems.

[BibT_eX]

[DOI]

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

On the Complexity of Separation from the Knapsack Polytope.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021

Orbital Conflict: Cutting Planes for Symmetric Integer Programs.

[BibT_eX]

[DOI]

INFORMS J. Optim., January, 2021

Parallelizing Subgradient Methods for the Lagrangian Dual in Stochastic Mixed-Integer Programming.

[BibT_eX]

[DOI]

INFORMS J. Optim., January, 2021

Piecewise polyhedral formulations for a multilinear term.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

Integer packing sets form a well-quasi-ordering.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

Minotaur: a mixed-integer nonlinear optimization toolkit.

[BibT_eX]

[DOI]

Math. Program. Comput., 2021

MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library.

[BibT_eX]

[DOI]

Math. Program. Comput., 2021

Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2021

2020

Strong Convex Nonlinear Relaxations of the Pooling Problem.

[BibT_eX]

[DOI]

SIAM J. Optim., 2020

The Mathematical Foundations of Epistemic Network Analysis.

[BibT_eX]

[DOI]

David Williamson Shaffer

Proceedings of the Advances in Quantitative Ethnography - Second International Conference, 2020

2018

Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming.

[BibT_eX]

[DOI]

SIAM J. Optim., 2018

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods.

[BibT_eX]

[DOI]

Pierre Bonami

Oktay Günlük

Math. Program. Comput., 2018

Valid inequalities for separable concave constraints with indicator variables.

[BibT_eX]

[DOI]

Cong Han Lim

Math. Program., 2018

Designing and Implementing Algorithms for Mixed-Integer Nonlinear Optimization (Dagstuhl Seminar 18081).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2018

2017

High Throughput Computing for Massive Scenario Analysis and Optimization to Minimize Cascading Blackout Risk.

[BibT_eX]

[DOI]

Eric James Anderson

IEEE Trans. Smart Grid, 2017

Lift-and-project cuts for convex mixed integer nonlinear programs.

[BibT_eX]

[DOI]

Mustafa R. Kilinç

Math. Program. Comput., 2017

Quadratic cone cutting surfaces for quadratic programs with on-off constraints.

[BibT_eX]

[DOI]

Hyemin Jeon

Golnaz Arastoopour Irgens

Andrew Miller

Discret. Optim., 2017

Data-enabled cognitive modeling: Validating student engineers' fuzzy design-based decision-making in a virtual design problem.

[BibT_eX]

[DOI]

Naomi C. Chesler

David Williamson Shaffer

Comput. Appl. Eng. Educ., 2017

2016

Special issue on "Integer programming under uncertainty".

[BibT_eX]

[DOI]

Shabbir Ahmed

Math. Program., 2016

A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching.

[BibT_eX]

[DOI]

Oper. Res., 2016

Optimizing customized program coverage.

[BibT_eX]

[DOI]

Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering, 2016

A procedure for improving the distribution of congestion in global routing.

[BibT_eX]

[DOI]

Daohang Shi

Proceedings of the 2016 Design, Automation & Test in Europe Conference & Exhibition, 2016

2015

Regularization vs. Relaxation: A conic optimization perspective of statistical variable selection.

[BibT_eX]

[DOI]

Hongbo Dong

Kun Chen

CoRR, 2015

Optimally solving Markov decision processes with total expected discounted reward function: Linear programming revisited.

[BibT_eX]

[DOI]

Oguzhan Alagöz

Mehmet U. S. Ayvaci

Comput. Ind. Eng., 2015

2014

Models and solution techniques for production planning problems with increasing byproducts.

[BibT_eX]

[DOI]

Srikrishna Sridhar

J. Glob. Optim., 2014

Strong-branching inequalities for convex mixed integer nonlinear programs.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2014

2013

Power-Driven Global Routing for Multisupply Voltage Domains.

[BibT_eX]

[DOI]

VLSI Design, 2013

Locally ideal formulations for piecewise linear functions with indicator variables.

[BibT_eX]

[DOI]

Srikrishna Sridhar

Oper. Res. Lett., 2013

Mixed-integer nonlinear optimization.

[BibT_eX]

[DOI]

Acta Numer., 2013

Planning for local net congestion in global routing.

[BibT_eX]

[DOI]

Hamid Shojaei

Proceedings of the International Symposium on Physical Design, 2013

On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators.

[BibT_eX]

[DOI]

Hongbo Dong

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

Some results on the strength of relaxations of multilinear functions.

[BibT_eX]

[DOI]

Mahdi Namazifar

Math. Program., 2012

The impact of sampling methods on bias and variance in stochastic linear programs.

[BibT_eX]

[DOI]

Michael Freimer

Douglas J. Thomas

Comput. Optim. Appl., 2012

2011

GRIP: Global Routing via Integer Programming.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2011

Solving large Steiner Triple Covering Problems.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2011

Orbital branching.

[BibT_eX]

[DOI]

Math. Program., 2011

Optimal response to attacks on the open science grid.

[BibT_eX]

[DOI]

Comput. Networks, 2011

Valid Inequalities for the Pooling Problem with Binary Variables.

[BibT_eX]

[DOI]

Claudia D'Ambrosio

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

Congestion analysis for global routing via integer programming.

[BibT_eX]

[DOI]

Hamid Shojaei

Proceedings of the 2011 IEEE/ACM International Conference on Computer-Aided Design, 2011

Power-driven global routing for multi-supply voltage domains.

[BibT_eX]

[DOI]

Proceedings of the Design, Automation and Test in Europe, 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

2010

Perspective reformulations of mixed integer nonlinear programs with indicator variables.

[BibT_eX]

[DOI]

Oktay Günlük

Math. Program., 2010

OR PRACTICE - R&D Project Portfolio Analysis for the Semiconductor Industry.

[BibT_eX]

[DOI]

Oper. Res., 2010

FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs.

[BibT_eX]

[DOI]

Kumar Abhishek

Sven Leyffer

INFORMS J. Comput., 2010

A parallel integer programming approach to global routing.

[BibT_eX]

[DOI]

Proceedings of the 47th Design Automation Conference, 2010

2009

Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing.

[BibT_eX]

[DOI]

François Margot

Greg Thain

INFORMS J. Comput., 2009

GRIP: scalable 3D global routing using integer programming.

[BibT_eX]

[DOI]

Proceedings of the 46th Design Automation Conference, 2009

2008

Reformulation and sampling to solve a stochastic network interdiction problem.

[BibT_eX]

[DOI]

Udom Janjarassuk

Networks, 2008

Combining optimization and simulation for strategic and operational industrial gas production and distribution.

[BibT_eX]

[DOI]

Comput. Chem. Eng., 2008

Constraint Orbital Branching.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables.

[BibT_eX]

[DOI]

Oktay Günlük

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2006

Optimization on grids - optimization for grids.

[BibT_eX]

[DOI]

Roberto Musmanno

Parallel Comput., 2006

The empirical behavior of sampling methods for stochastic programming.

[BibT_eX]

[DOI]

Alexander Shapiro

Stephen J. Wright

Ann. Oper. Res., 2006

2005

A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs.

[BibT_eX]

[DOI]

Math. Program., 2005

5. Computational Grids for Stochastic Programming.

[BibT_eX]

[DOI]

Stephen J. Wright

Proceedings of the Applications of Stochastic Programming, 2005

2004

COAP 2003 Best Paper Award.

[BibT_eX]

[DOI]

Steven J. Wright

Comput. Optim. Appl., 2004

2003

Decomposition Algorithms for Stochastic Programming on a Computational Grid.

[BibT_eX]

[DOI]

Stephen J. Wright

Comput. Optim. Appl., 2003

2002

A branch and cut approach to the cardinality constrained circuit problem.

[BibT_eX]

[DOI]

Petra Bauer

Math. Program., 2002

Solving large quadratic assignment problems on computational grids.

[BibT_eX]

[DOI]

Math. Program., 2002

2001

A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems.

[BibT_eX]

[DOI]

Eva K. Lee

INFORMS J. Comput., 2001

Master-Worker: An Enabling Framework for Applications on the Computational Grid.

[BibT_eX]

[DOI]

Clust. Comput., 2001

FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver.

[BibT_eX]

[DOI]

Qun Chen

Michael C. Ferris

Ann. Oper. Res., 2001

2000

A Relational Modeling System for Linear and Integer Programming.

[BibT_eX]

[DOI]

Alper Atamtürk

Ellis L. Johnson

Oper. Res., 2000

An Enabling Framework for Master-Worker Applications on the Computational Grid.

[BibT_eX]

[DOI]

Proceedings of the Ninth IEEE International Symposium on High Performance Distributed Computing, 2000

1999

A Computational Study of Search Strategies for Mixed Integer Programming.

[BibT_eX]

[DOI]