The following pages link to Francisco Barahona (Q270026):
Displaying 22 items.
- Note on Weintraub’s Minimum-Cost Circulation Algorithm (Q3829324) (← links)
- (Q3911697) (← links)
- (Q3973411) (← links)
- Design and Implementation of an Interactive Optimization System for Telephone Network Planning (Q3990558) (← links)
- Reducing Matching to Polynomial Size Linear Programming (Q4277507) (← links)
- Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs (Q4307044) (← links)
- Compositions of Graphs and Polyhedra II: Stable Sets (Q4307045) (← links)
- Compositions of Graphs and Polyhedra III: Graphs with No $W_4 $ Minor (Q4307046) (← links)
- Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs (Q4307047) (← links)
- (Q4527180) (← links)
- On the <i>p</i>‐median polytope and the odd directed cycle inequalities: Oriented graphs (Q4584866) (← links)
- Fractional Packing of<i>T</i>-Joins (Q4652614) (← links)
- On the cut polytope (Q4726054) (← links)
- Packing Spanning Trees (Q4835388) (← links)
- (Q4857012) (← links)
- Network Design Using Cut Inequalities (Q4895623) (← links)
- (Q5288797) (← links)
- Robust capacity planning in semiconductor manufacturing (Q5318289) (← links)
- Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches (Q5322107) (← links)
- A polyhedral study of a two level facility location model (Q5418010) (← links)
- Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs (Q5418987) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
