The following pages link to Francisco Barahona (Q270026):
Displaying 50 items.
- Stackelberg bipartite vertex cover and the preflow algorithm (Q270027) (← links)
- On the linear relaxation of the \(p\)-median problem (Q429694) (← links)
- The max-cut problem on graphs not contractible to \(K_ 5\) (Q593988) (← links)
- Faster algorithms for security games on matroids (Q666676) (← links)
- On the nucleolus of shortest path games (Q681844) (← links)
- On cuts and matchings in planar graphs (Q688915) (← links)
- On some weakly bipartite graphs (Q800231) (← links)
- On the \(p\)-median polytope of \(Y\)-free graphs (Q951093) (← links)
- (Q1078185) (redirect page) (← links)
- On the cycle polytope of a binary matroid (Q1078187) (← links)
- A solvable case of quadratic 0-1 programming (Q1079494) (← links)
- Exact arborescences, matchings and cycles (Q1095157) (← links)
- A construction for binary matroids (Q1102297) (← links)
- Facets of the balanced (acyclic) induced subgraph polytope (Q1122491) (← links)
- Experiments in quadratic 0-1 programming (Q1123806) (← links)
- Separating from the dominant of the spanning tree polytope (Q1200792) (← links)
- Plant location with minimum inventory (Q1290654) (← links)
- On the magnetisation of the ground states in two dimensional Ising spin glasses (Q1344221) (← links)
- On some difficult linear programs coming from set partitioning (Q1348247) (← links)
- Solving Steiner tree problems in graphs with Lagrangian relaxation (Q1417851) (← links)
- The volume algorithm: Producing primal solutions with a subgradient method (Q1575065) (← links)
- On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs (Q1751184) (← links)
- Near-optimal solutions to large-scale facility location problems (Q1779687) (← links)
- On a connection between facility location and perfect graphs (Q1785286) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- On two-connected subgraph polytopes (Q1910503) (← links)
- On the \(k\)-cut problem (Q1977642) (← links)
- An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks (Q2064296) (← links)
- On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
- On the \(p\)-median polytope and the directed odd cycle inequalities (Q2225045) (← links)
- Network strength games: the core and the nucleolus (Q2297643) (← links)
- On dual integrality in matching problems (Q2314407) (← links)
- Separation of partition inequalities with terminals (Q2386198) (← links)
- Network reinforcement (Q2583121) (← links)
- Separation of Partition Inequalities (Q2757634) (← links)
- Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs (Q2813347) (← links)
- On the p-median polytope of fork-free graphs (Q2883561) (← links)
- On the Location and p-Median Polytopes (Q2971602) (← links)
- On the <i>p</i>-Median Polytope and the Intersection Property: Polyhedra and Algorithms (Q3094898) (← links)
- (Q3109933) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- The Dominating Set Polytope via Facility Location (Q3195312) (← links)
- A submodular network simplex method (Q3220318) (← links)
- (Q3360020) (← links)
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
- A linear programming approach to increasing the weight of all minimum spanning trees (Q3548723) (← links)
- On the Integrality of Some Facility Location Polytopes (Q3563933) (← links)
- Facets of the Bipartite Subgraph Polytope (Q3699730) (← links)
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design (Q3790963) (← links)
