# Paper repository

An Algorithm to Compute the Nucleolus of Shortest Path Games — Apr 23, 2019 5:27:58 PM

Network Design — Jun 29, 2017 7:08:51 PM

network design — Jun 29, 2017 7:02:56 PM

MAXIMUM WEIGHTED INDUCED BIPARTITE SUBGRAPHS AND ACYCLIC SUBGRAPHS OF PLANAR CUBIC GRAPHS — Jun 28, 2016 3:02:06 PM

Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem — Jun 21, 2016 8:48:52 PM

An application of combinatorial optimization to statistical physics and circuit layout design — Oct 13, 2015 5:17:42 PM

Facets of the Bipartite Subgraph Polytope — Aug 31, 2015 4:34:56 PM

A Linear Programming Approach to Increasing the Weight of All Minimum Spanning Trees — Apr 7, 2015 8:47:06 PM

Planar Multicommodity Flows, Max Cut and the Chinese Postman Problem — Nov 12, 2014 6:36:39 PM

On a connection between facility location and perfect graphs — Oct 3, 2014 6:53:50 PM

Network Reinforcement — Jul 18, 2014 8:46:55 PM

A polyhedral study of a two level facility location model — Mar 18, 2014 9:19:29 PM

Separating from the dominant of the spanning tree polytope — Mar 18, 2014 8:07:39 PM

Combinatorial Optimization Top Ten List — Mar 18, 2014 7:47:15 PM

Application de l'Optimisation Combinatoire a certaines modeles de Verres de Spins: Complexite et Simulations — Sep 18, 2013 12:41:49 PM

Finding ground states of random field Ising ferromagnets — Jul 30, 2013 7:31:55 PM

EXPERIMENTS IN QUADRATIC 0-1 PROGRAMMING — Jun 14, 2013 8:13:42 PM

Ground state magnetization of Ising spin glasses — Jun 5, 2013 6:31:31 PM

On the exact ground states of three-dimensional Ising spin glasses — Jun 5, 2013 6:23:31 PM

Morphology of ground states of two-dimensional frustration model — Jul 17, 2012 7:57:11 PM

Top Cited Article 2005-2010, Discrete Optimization — Apr 27, 2012 2:49:10 PM

Partition Inequalities: Separation, Extensions and Network Design — Jan 26, 2012 5:28:49 PM

On some difficult linear programs coming from set partitioning — Jan 24, 2012 5:10:03 PM

Packing spanning trees — Aug 3, 2011 6:07:56 PM

Intensive optimization of masks and sources for 22nm lithography — Apr 18, 2011 5:54:05 PM

Demonstrating the Benefits of Source-Mask Optimization and Enabling Technologies through Experiment and Simulations — Apr 18, 2011 5:43:40 PM

Design specific joint optimization of masks and sources on a very large scale — Apr 18, 2011 4:57:12 PM

Network Design Using Cut Inequalities — Feb 10, 2011 3:43:55 PM

Plant location with minimum inventory — Feb 10, 2011 3:41:40 PM

On the linear relaxation of the p-median problem — Feb 10, 2011 3:39:25 PM

Near-optimal solutions to large-scale facility location problems — Feb 7, 2011 3:44:52 PM

ON THE INTEGRALITY OF SOME FACILITY LOCATION POLYTOPES — Feb 7, 2011 3:36:46 PM

ON THE p-MEDIAN POLYTOPE AND THE INTERSECTION PROPERTY: POLYHEDRA AND ALGORITHMS — Jan 4, 2011 9:25:31 PM

Separation of partition inequalities — Nov 18, 2010 6:55:49 PM

On the cycle polytope of a binary matroid — Nov 18, 2010 4:50:27 PM

Compositions of Graphs and Polyhedra II: Stable Sets — Nov 18, 2010 2:57:54 PM

Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor — Nov 18, 2010 2:49:30 PM

Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs — Nov 18, 2010 2:43:23 PM

On cuts and matchings in planar graphs — Nov 17, 2010 5:34:01 PM

The volume algorithm: producing primal solutions with a subgradient method — Nov 16, 2010 11:31:13 PM

On the Cut Polytope — Nov 16, 2010 6:46:49 PM

Reducing Matching to Polynomial Size Linear Programming — Nov 16, 2010 5:24:09 PM

Network Design Using Cut Inequalities — Oct 13, 2009 12:35:55 AM

Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs — Oct 13, 2009 12:34:09 AM

On the computational complexity of Ising spin glass models — Oct 12, 2009 11:33:21 PM

On some algorithmic aspects of hypergraphic matroids