Conferences in DBLP

Integer Programming and Combinatorial Optimization (IPCO) (ipco)
2008 (conf/ipco/2008)

1. 
   Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables. [Citation Graph (, )][DBLP]
   
   
2. 
   Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs. [Citation Graph (, )][DBLP]
   
   
3. 
   The Air Traffic Flow Management Problem: An Integer Optimization Approach. [Citation Graph (, )][DBLP]
   
   
4. 
   The Induced Disjoint Paths Problem. [Citation Graph (, )][DBLP]
   
   
5. 
   A Weighted Kt, t-Free t-Factor Algorithm for Bipartite Graphs. [Citation Graph (, )][DBLP]
   
   
6. 
   A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs. [Citation Graph (, )][DBLP]
   
   
7. 
   A Polynomial Algorithm for Weighted Abstract Flow. [Citation Graph (, )][DBLP]
   
   
8. 
   A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem. [Citation Graph (, )][DBLP]
   
   
9. 
   Binary Positive Semidefinite Matrices and Associated Integer Polytopes. [Citation Graph (, )][DBLP]
   
   
10. 
    Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities. [Citation Graph (, )][DBLP]
    
    
11. 
    Tight Bounds for Permutation Flow Shop Scheduling. [Citation Graph (, )][DBLP]
    
    
12. 
    The Stochastic Machine Replenishment Problem. [Citation Graph (, )][DBLP]
    
    
13. 
    A Polynomial Time Approximation Scheme for the Square Packing Problem. [Citation Graph (, )][DBLP]
    
    
14. 
    Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints. [Citation Graph (, )][DBLP]
    
    
15. 
    Computing with Multi-row Gomory Cuts. [Citation Graph (, )][DBLP]
    
    
16. 
    Constraint Orbital Branching. [Citation Graph (, )][DBLP]
    
    
17. 
    A Fast, Simpler Algorithm for the Matroid Parity Problem. [Citation Graph (, )][DBLP]
    
    
18. 
    Degree Bounded Matroids and Submodular Flows. [Citation Graph (, )][DBLP]
    
    
19. 
    Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. [Citation Graph (, )][DBLP]
    
    
20. 
    Primal-Dual Schema for Capacitated Covering Problems. [Citation Graph (, )][DBLP]
    
    
21. 
    Offline and Online Facility Leasing. [Citation Graph (, )][DBLP]
    
    
22. 
    Importance Sampling via Load-Balanced Facility Location. [Citation Graph (, )][DBLP]
    
    
23. 
    A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem. [Citation Graph (, )][DBLP]
    
    
24. 
    New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. [Citation Graph (, )][DBLP]
    
    
25. 
    Min Sum Edge Coloring in Multigraphs Via Configuration LP. [Citation Graph (, )][DBLP]
    
    
26. 
    An Improved Algorithm for Finding Cycles Through Elements. [Citation Graph (, )][DBLP]
    
    
27. 
    The Stable Roommates Problem with Choice Functions. [Citation Graph (, )][DBLP]
    
    
28. 
    A New Approach to Splitting-Off. [Citation Graph (, )][DBLP]
    
    
29. 
    Can Pure Cutting Plane Algorithms Work?. [Citation Graph (, )][DBLP]
    
    
30. 
    The Mixing Set with Divisible Capacities. [Citation Graph (, )][DBLP]
    
    
31. 
    A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging. [Citation Graph (, )][DBLP]
    
    
32. 
    Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles. [Citation Graph (, )][DBLP]