Search this site
Home
About me
Papers by subject
Paper repository
Patents
Combinatorial Optimization Top Ten List
Papers by subject
Physics
Application de l'Optimisation Combinatoire a certaines modeles de Verres de Spins: Complexite et Simulations
Morphology of ground states of two-dimensional frustration model
On the computational complexity of Ising spin glass models
On the exact ground states of three-dimensional Ising spin glasses
Ground state magnetization of Ising spin glasses
Finding ground states of random field Ising ferromagnets
k-cut
On the k-cut problem
Max Cut
On the computational complexity of Ising spin glass models
Planar Multicommodity Flows, Max Cut and the Chinese Postman Problem
On the Cut Polytope
Facets of the Bipartite Subgraph Polytope
On the cycle polytope of a binary matroid
On cuts and matchings in planar graphs
Experiments in quadratic 0-1 programming
An application of combinatorial optimization to statistical physics and circuit layout design
Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
Sparsest Cut
Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem
Compositions of Graphs and Polyhedra
Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs
Compositions of Graphs and Polyhedra II: Stable Sets
Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor
Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
Extended formulations, Polynomial size linear programming
On cuts and matchings in planar graphs
Reducing Matching to Polynomial Size Linear Programming
Spanning trees
Separating from the dominant of the spanning tree polytope
Packing spanning trees
Network Reinforcement
A Linear Programming Approach to Increasing the Weight of All Minimum Spanning Trees
Separation of partition inequalities
Separating from the dominant of the spanning tree polytope
Separation of partition inequalities
Partition Inequalities: Separation, Extensions and Network Design
Volume Algorithm
The volume algorithm: producing primal solutions with a subgradient method
On some difficult linear programs coming from set partitioning
Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods
Facility Location, p-Median
On a connection between facility location and perfect graphs
A polyhedral study of a two level facility location model
On the linear relaxation of the p-median problem
On the p-median polytope and the intersection property: polyhedra and algorithms
Near-optimal solutions to large-scale facility location problems
On the integrality of some facility location polytopes
Plant location with minimum inventory
Network Design
Network Design Using Cut Inequalities
Optical Lithography
Design specific joint optimization of masks and sources on a very large scale
Demonstrating the Benefits of Source-Mask Optimization and Enabling Technologies through Experiment and Simulations
Intensive optimization of masks and sources for 22nm lithography
Algorithmic Game Theory
An Algorithm to Compute the Nucleolus of Shortest Path Games