Jean-Philippe P. Richard

SIAM J. Optim., 2024

Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities.

[BibT_eX]

[DOI]

Xiaoyi Gu

INFORMS J. Comput., 2024

A Sequential Follower Refinement Algorithm for Robust Surgery Scheduling.

[BibT_eX]

[DOI]

Ankit Bansal

Bjorn P. Berg

Yu-Li Huang

INFORMS J. Comput., 2024

2023

Smart Predict-then-Optimize for Two-Stage Linear Programs with Side Information.

[BibT_eX]

[DOI]

Alexander S. Estes

INFORMS J. Optim., July, 2023

Lifting convex inequalities for bipartite bilinear programs.

[BibT_eX]

[DOI]

Xiaoyi Gu

Math. Program., February, 2023

2022

Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis.

[BibT_eX]

[DOI]

Jinhak Kim

Math. Oper. Res., November, 2022

2021

Convexification techniques for linear complementarity constraints.

[BibT_eX]

[DOI]

Trang T. Nguyen

J. Glob. Optim., 2021

A Facility Location and Allocation Model for Cooperative Fire Services.

[BibT_eX]

[DOI]

Jinke Ming

Jiping Zhu

IEEE Access, 2021

2019

On cutting planes for cardinality-constrained linear programs.

[BibT_eX]

[DOI]

Jinhak Kim

Math. Program., 2019

Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling.

[BibT_eX]

[DOI]

Danial Davarnia

Ece Içyüz-Ay

Bijan Taslimi

Oper. Res., 2019

2018

Deriving convex hulls through lifting and projection.

[BibT_eX]

[DOI]

Trang T. Nguyen

Math. Program., 2018

2017

Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction.

[BibT_eX]

[DOI]

Danial Davarnia

SIAM J. Optim., 2017

2016

A Two-Model Solution Approach for the Monthly Coal Train Reservations Planning Problem.

[BibT_eX]

[DOI]

I. Ece Içyüz

Erdem Eskigun

Dharma Acharya

Transp. Sci., 2016

A class of algorithms for mixed-integer bilevel min-max optimization.

[BibT_eX]

[DOI]

Yen Tang

J. Cole Smith

J. Glob. Optim., 2016

2015

Multi-commodity variable upper bound flow models.

[BibT_eX]

[DOI]

D. L. Burchett

Discret. Optim., 2015

An integrated supply chain problem: a nested lagrangian relaxation approach.

[BibT_eX]

[DOI]

Ali Diabat

Ann. Oper. Res., 2015

2014

Lifted inequalities for $$0\mathord {-}1$$ mixed-integer bilinear covering sets.

[BibT_eX]

[DOI]

Kwanghun Chung

Math. Program., 2014

2013

A column generation-based heuristic algorithm for an inventory routing problem with perishable goods.

[BibT_eX]

[DOI]

Tung H. Le

Ali Diabat

Yuehwern Yih

Optim. Lett., 2013

Explicit convex and concave envelopes through polyhedral subdivisions.

[BibT_eX]

[DOI]

Chuanhui Xiong

Math. Program., 2013

A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design.

[BibT_eX]

[DOI]

Ali Diabat

Craig W. Codrington

Ann. Oper. Res., 2013

2012

Strong valid inequalities for fluence map optimization problem under dose-volume restrictions.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2012

2011

Lifted Tableaux Inequalities for 0-1 Mixed-Integer Programs: A Computational Study.

[BibT_eX]

[DOI]

Amar Kumar Narisetty

INFORMS J. Comput., 2011

A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Facet-defining inequalities by sequential lifting.

[BibT_eX]

[DOI]

Bo Zeng

Discret. Optim., 2011

A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Strong valid inequalities by sequence-independent lifting.

[BibT_eX]

[DOI]

Bo Zeng

Discret. Optim., 2011

2010

Strong valid inequalities for orthogonal disjunctions and bilinear covering sets.

[BibT_eX]

[DOI]

Kwanghun Chung

Math. Program., 2010

Lifting inequalities: a framework for generating strong cuts for nonlinear programs.

[BibT_eX]

[DOI]

Math. Program., 2010

On the extreme inequalities of infinite group problems.

[BibT_eX]

[DOI]

Yanjun Li

Lisa A. Miller

Math. Program., 2010

Relations between facets of low- and high-dimensional group problems.

[BibT_eX]

[DOI]

Math. Program., 2010

The Group-Theoretic Approach in Mixed Integer Programming.

[BibT_eX]

[DOI]

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

2009

Valid inequalities for MIPs and group polyhedra from approximate liftings.

[BibT_eX]

[DOI]

Yanjun Li

Lisa A. Miller

Math. Program., 2009

Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2009

2008

Facets of Two-Dimensional Infinite Group Problems.

[BibT_eX]

[DOI]

Math. Oper. Res., 2008

An Optimization Model for Empty Freight Car Assignment at Union Pacific Railroad.

[BibT_eX]

[DOI]

Amar Kumar Narisetty

Interfaces, 2008

Cook, Kannan and Schrijver's example revisited.

[BibT_eX]

[DOI]

Yanjun Li

Discret. Optim., 2008

2007

A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications.

[BibT_eX]

[DOI]

Bo Zeng

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Sequential-Merge Facets for Two-Dimensional Group Problems.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

Minimizing the Consequences of Intentional Attack on Water Infrastructure.

[BibT_eX]

[DOI]

Yuehwern Yih

Comput. Aided Civ. Infrastructure Eng., 2006

2003

Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting.

[BibT_eX]

[DOI]

Ismael R. de Farias Jr.

Math. Program., 2003

Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms.

[BibT_eX]

[DOI]

Ismael R. de Farias Jr.

Math. Program., 2003

2001

A Simplex-Based Algorithm for 0-1 Mixed Integer Programming.

[BibT_eX]

[DOI]

Ismael R. de Farias Jr.