Francisco Barahona

Discret. Math., 2023

Approximate Inference in Logical Credal Networks.

[BibT_eX]

[DOI]

Radu Marinescu

Haifeng Qian

Alexander G. Gray

Debarun Bhattacharjya

Tian Gao

Ryan Riegel

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

Network disconnection games: A game theoretic approach to checkpoint evaluation in networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Logical Credal Networks.

[BibT_eX]

[DOI]

Radu Marinescu

Haifeng Qian

Alexander G. Gray

Debarun Bhattacharjya

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Packing Hypertrees and the k-cut Problem in Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization - 16th International Conference, 2022

2021

Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2021

2020

Network strength games: the core and the nucleolus.

[BibT_eX]

[DOI]

Math. Program., 2020

Logical Neural Networks.

[BibT_eX]

[DOI]

Ismail Yunus Akhalwaya

Santosh K. Srivastava

CoRR, 2020

On the p-Median Polytope and the Directed Odd Cycle Inequalities.

[BibT_eX]

[DOI]

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

2019

An Algorithm to Compute the Nucleolus of Shortest Path Games.

[BibT_eX]

[DOI]

Algorithmica, 2019

Faster Algorithms for Security Games on Matroids.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

On the p-median polytope and the odd directed cycle inequalities: Oriented graphs.

[BibT_eX]

[DOI]

Networks, 2018

Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem.

[BibT_eX]

[DOI]

Math. Program., 2018

2017

On the Nucleolus of Shortest Path Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016

Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2016

Stackelberg Bipartite Vertex Cover and the Preflow Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 2016

2014

A polyhedral study of a two level facility location model.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2014

On a connection between facility location and perfect graphs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

Simulation based analytics for efficient planning and management in multimodal freight transportation industry.

[BibT_eX]

[DOI]

Proceedings of the 2014 Winter Simulation Conference, 2014

The Dominating Set Polytope via Facility Location.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013

Agile logistics simulation and optimization for managing disaster responses.

[BibT_eX]

[DOI]

Proceedings of the Winter Simulations Conference: Simulation Making Decisions in a Complex World, 2013

2011

On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms.

[BibT_eX]

[DOI]

José Correa

SIAM J. Discret. Math., 2011

On the linear relaxation of the p-median problem.

[BibT_eX]

[DOI]

Discret. Optim., 2011

2010

On the p-median polytope of fork-free graphs.

[BibT_eX]

[DOI]

José Correa

Electron. Notes Discret. Math., 2010

2009

On the Integrality of Some Facility Location Polytopes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

2008

A linear programming approach to increasing the weight of all minimum spanning trees.

[BibT_eX]

[DOI]

Networks, 2008

On the p-median polytope of Y-free graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2008

On the Location and p-Median Polytopes.

[BibT_eX]

[DOI]

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007

Inventory allocation and transportation scheduling for logistics of network-centric military operations.

[BibT_eX]

[DOI]

IBM J. Res. Dev., 2007

2006

Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut.

[BibT_eX]

[DOI]

Laszlo Ladányi

RAIRO Oper. Res., 2006

Network reinforcement.

[BibT_eX]

[DOI]

Math. Program., 2006

2005

Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches.

[BibT_eX]

[DOI]

Oper. Res., 2005

Near-optimal solutions to large-scale facility location problems.

[BibT_eX]

[DOI]

Fabián A. Chudak

Discret. Optim., 2005

2004

Fractional Packing of T-Joins.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Separation of partition inequalities with terminals.

[BibT_eX]

[DOI]

Hervé Kerivin

Discret. Optim., 2004

2003

Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation.

[BibT_eX]

[DOI]

Laura Bahiense

Oscar Porto

J. Comb. Optim., 2003

2002

On some difficult linear programs coming from set partitioning.

[BibT_eX]

[DOI]

Ranga Anbil

Discret. Appl. Math., 2002

2000

On the k-cut problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2000

The volume algorithm: producing primal solutions with a subgradient method.

[BibT_eX]

[DOI]

Ranga Anbil

Math. Program., 2000

Separation of Partition Inequalities.

[BibT_eX]

[DOI]

Math. Oper. Res., 2000

1998

Plant location with minimum inventory.

[BibT_eX]

[DOI]

David L. Jensen

Math. Program., 1998

1996

Network Design Using Cut Inequalities.

[BibT_eX]

[DOI]

SIAM J. Optim., 1996

1995

Packing Spanning Trees.

[BibT_eX]

[DOI]

Math. Oper. Res., 1995

On two-connected subgraph polytopes.

[BibT_eX]

[DOI]

Discret. Math., 1995

1994

Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1994

Compositions of Graphs and Polyhedra II: Stable Sets.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1994

Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1994

Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs.

[BibT_eX]

[DOI]

Jean Fonlupt

SIAM J. Discret. Math., 1994

1993

Reducing Matching to Polynomial Size Linear Programming.

[BibT_eX]

[DOI]

SIAM J. Optim., 1993

On cuts and matchings in planar graphs.

[BibT_eX]

[DOI]

Math. Program., 1993

1992

Separating from the dominant of the spanning tree polytope.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1992

Habitat Dispersion in Forest Planning and the Stable Set Problem.

[BibT_eX]

[DOI]

Andrés Weintraub

Rafael Epstein

Oper. Res., 1992

On 2-Connected Subgraph Polytopes.

[BibT_eX]

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1990

Planar Multicommodity Flows, Max Cut, and the Chinese Postman Problem.

[BibT_eX]

[DOI]

Proceedings of the Polyhedral Combinatorics, 1990

1989

Note on Weintraub's Minimum-Cost Circulation Algorithm.

[BibT_eX]

[DOI]

Éva Tardos

SIAM J. Comput., 1989

Facets of the balanced (acyclic) induced subgraph polytope.

[BibT_eX]

[DOI]

Math. Program., 1989

Experiments in quadratic 0-1 programming.

[BibT_eX]

[DOI]

Michael Jünger

Gerhard Reinelt

Math. Program., 1989

1988

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design.

[BibT_eX]

[DOI]

Oper. Res., 1988

1987

A construction for binary matroids.

[BibT_eX]

[DOI]

Michele Conforti

Discret. Math., 1987

Exact arborescences, matchings and cycles.

[BibT_eX]

[DOI]

William R. Pulleyblank

Discret. Appl. Math., 1987

1986

On the cut polytope.

[BibT_eX]

[DOI]

Math. Program., 1986

On the cycle polytope of a binary matroid.

[BibT_eX]

[DOI]

Martin Grötschel

J. Comb. Theory B, 1986

A solvable case of quadratic 0-1 programming.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

1985

Facets of the Bipartite Subgraph Polytope.

[BibT_eX]

[DOI]

Martin Grötschel

Math. Oper. Res., 1985

1980

Application de l'optimisation combinatoire à certains modèles de verres de spins : complexité et simulations.

[BibT_eX]

[DOI]