Search this site
Embedded Files
Skip to main content
Skip to navigation
barahon
Home
About me
Paper repository
A Linear Programming Approach to Increasing the Weight of All Minimum Spanning Trees
A polyhedral study of a two level facility location model
An Algorithm to Compute the Nucleolus of Shortest Path Games
An application of combinatorial optimization to statistical physics and circuit layout design
Application de l'Optimisation Combinatoire a certaines modeles de Verres de Spins: Complexite et Simulations
Combinatorial Optimization Top Ten List
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
Demonstrating the Benefits of Source-Mask Optimization and Enabling Technologies through Experiment and Simulations
Design specific joint optimization of masks and sources on a very large scale
EXPERIMENTS IN QUADRATIC 0-1 PROGRAMMING
Facets of the Bipartite Subgraph Polytope
Finding ground states of random field Ising ferromagnets
Ground state magnetization of Ising spin glasses
Intensive optimization of masks and sources for 22nm lithography
MAXIMUM WEIGHTED INDUCED BIPARTITE SUBGRAPHS AND ACYCLIC SUBGRAPHS OF PLANAR CUBIC GRAPHS
Morphology of ground states of two-dimensional frustration model
Near-optimal solutions to large-scale facility location problems
network design
Network Design
Network Design Using Cut Inequalities
Network Design Using Cut Inequalities
Network Reinforcement
On a connection between facility location and perfect graphs
On cuts and matchings in planar graphs
On some difficult linear programs coming from set partitioning
On the computational complexity of Ising spin glass models
On the Cut Polytope
On the cycle polytope of a binary matroid
On the exact ground states of three-dimensional Ising spin glasses
ON THE INTEGRALITY OF SOME FACILITY LOCATION POLYTOPES
On the linear relaxation of the p-median problem
ON THE p-MEDIAN POLYTOPE AND THE INTERSECTION PROPERTY: POLYHEDRA AND ALGORITHMS
Packing spanning trees
Partition Inequalities: Separation, Extensions and Network Design
Planar Multicommodity Flows, Max Cut and the Chinese Postman Problem
Plant location with minimum inventory
Reducing Matching to Polynomial Size Linear Programming
Separating from the dominant of the spanning tree polytope
Separation of partition inequalities
Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem
The volume algorithm: producing primal solutions with a subgradient method
Top Cited Article 2005-2010, Discrete Optimization
Papers by subject
Patents
Approximation method for efficient resource allocation
Method and system for scheduling delivery of at least one of goods and services
barahon
Combinatorial Optimization Top Ten List
Post date: Mar 18, 2014 7:47:15 PM
by William R. Pulleyblank, ISMP 2000
Google Sites
Report abuse
Page details
Page updated
Google Sites
Report abuse
