Sunil Chopra

Vadim Glinskiy

Eur. J. Oper. Res., 2024

2023

An Exact Solution Method for the Political Districting Problem.

[BibT_eX]

[DOI]

Hyunwoo Park

Parallel Process. Lett., 2023

Parallel Power System Restoration.

[BibT_eX]

[DOI]

Feng Qiu

INFORMS J. Comput., 2023

2022

A Bounded Formulation for The School Bus Scheduling Problem.

[BibT_eX]

[DOI]

Liwei Zeng

Transp. Sci., 2022

The Value of Information and Flexibility with Temporal Commitments.

[BibT_eX]

[DOI]

Pol Boada-Collado

Manuf. Serv. Oper. Manag., 2022

Extended Graph Formulation for the Inequity Aversion Pricing Problem on Social Networks.

[BibT_eX]

[DOI]

Hyunwoo Park

INFORMS J. Comput., 2022

Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

2021

Achieving supply chain efficiency and resilience by using multi-level commons.

[BibT_eX]

[DOI]

ManMohan S. Sodhi

Decis. Sci., 2021

2020

Partial Demand Information and Commitment in Dynamic Transportation Procurement.

[BibT_eX]

[DOI]

Pol Boada-Collado

Transp. Sci., 2020

A strong formulation for the graph partition problem.

[BibT_eX]

[DOI]

Networks, 2020

Managing Disruption Risk Over the Product Life Cycle.

[BibT_eX]

[DOI]

Vadim Glinsky

Found. Trends Technol. Inf. Oper. Manag., 2020

2019

The Covering Path Problem on a Grid.

[BibT_eX]

[DOI]

Liwei Zeng

Transp. Sci., 2019

Disruption Risk Management in Serial Multi-Echelon Supply Chains.

[BibT_eX]

[DOI]

Ralf W. Seifert

Found. Trends Technol. Inf. Oper. Manag., 2019

A concise characterization of strong knapsack facets.

[BibT_eX]

[DOI]

Daniel E. Steffy

Discret. Appl. Math., 2019

Generalizing the Covering Path Problem on a Grid.

[BibT_eX]

[DOI]

Liwei Zeng

CoRR, 2019

2017

The worst case analysis of strong knapsack facets.

[BibT_eX]

[DOI]

Wenwei Cao

Math. Program., 2017

An extended formulation of the convex recoloring problem on a tree.

[BibT_eX]

[DOI]

Math. Program., 2017

2016

Eco-activities and operating performance in the computer and electronics industry.

[BibT_eX]

[DOI]

Pei-Ju Wu

Eur. J. Oper. Res., 2016

Separation Algorithm for Tree Partitioning Inequalities.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

2013

Binary group facets with complete support and non-binary coefficients.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2013

Facility Location Decisions with Random Disruptions and Imperfect Estimation.

[BibT_eX]

[DOI]

Manuf. Serv. Oper. Manag., 2013

2004

Five Decades of Operations Management and the Prospects Ahead.

[BibT_eX]

[DOI]

William S. Lovejoy

Candace A. Yano

Manag. Sci., 2004

The Effect of Lead Time Uncertainty on Safety Stocks.

[BibT_eX]

[DOI]

Gilles Reinhardt

Maqbool Dada

Decis. Sci., 2004

2002

Cost Allocation for a Tree Network with Heterogeneous Customers.

[BibT_eX]

[DOI]

Daniel Granot

Jeroen Kuipers

Math. Oper. Res., 2002

A branch-and-cut approach for minimum cost multi-level network design.

[BibT_eX]

[DOI]

Michael Mesterton-Gibbons

Chih-Yang Tsai

Discret. Math., 2002

1999

Networks And Flows.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Discrete Optimization.

[BibT_eX]

[DOI]

Joseph R. Barr

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

A Note on Formulations for the A-partition Problem on Hypergraphs.

[BibT_eX]

[DOI]

Jonathan H. Owen

Discret. Appl. Math., 1999

1998

Minimum cost capacity installation for multicommodity network flows.

[BibT_eX]

[DOI]

Math. Program., 1998

Source Sink Flows with Capacity Installation in Batches.

[BibT_eX]

[DOI]

Itzhak Gilboa

S. Trilochan Sastry

Discret. Appl. Math., 1998

1996

Minimum-Cost Node-Disjoint Steiner Trees in Series-Parallel Networks.

[BibT_eX]

[DOI]

Kalyan T. Talluri

VLSI Design, 1996

The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities.

[BibT_eX]

[DOI]

Giovanni Rinaldi

SIAM J. Discret. Math., 1996

Extended formulations for the A-cut problem.

[BibT_eX]

[DOI]

Jonathan H. Owen

Math. Program., 1996

Algorithms and Extended Formulations for One and Two Facility Network Design.

[BibT_eX]

[DOI]

Itzhak Gilboa

S. Trilochan Sastry

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

Facets of the K-partition Polytope.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

Compositions for Matroids with the Fulkerson Property.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

1994

The k-Edge-Connected Spanning Subgraph Polyhedron.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1994

The Graph Partitioning Polytope on Series-Parallel and4-Wheel Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1994

The Steiner tree problem II: Properties and classes of facets.

[BibT_eX]

[DOI]

Math. Program., 1994

The Steiner tree problem I: Formulations, compositions and extension of facets.

[BibT_eX]

[DOI]

Math. Program., 1994

Comparison of formulations and a heuristic for packing Steiner trees in a graph.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1994

1993

The partition problem.

[BibT_eX]

[DOI]

Math. Program., 1993

1992

The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

Solving the Steiner Tree Problem on a Graph Using Branch and Cut.

[BibT_eX]

[DOI]

Edgar R. Gorres

INFORMS J. Comput., 1992

1991

On the multiway cut polyhedron.

[BibT_eX]

[DOI]

Networks, 1991

1990

The Graphical Asymmetric Traveling Salesman Polyhedron.

[BibT_eX]

Giovanni Rinaldi

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989

Polyhedra of regular<i>p</i>-nary group problems.

[BibT_eX]

[DOI]

David L. Jensen

Ellis L. Johnson

Math. Program., 1989

On ternary problems.

[BibT_eX]

[DOI]

Math. Program., 1989

1987

Dual row modules and polyhedra of blocking group problems.

[BibT_eX]

[DOI]