Pages that link to "Item:Q1168215"
From MaRDI portal
The following pages link to The ellipsoid method and its consequences in combinatorial optimization (Q1168215):
Displayed 50 items.
- How to recycle your facets (Q2506820) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- Orthogonal representations over finite fields and the chromatic number of graphs (Q2563517) (← links)
- Perfect circular arc coloring (Q2569164) (← links)
- A linear programming formulation of Mader's edge-disjoint paths problem (Q2581506) (← links)
- On balanced graphs (Q2583124) (← links)
- A linear programming formulation for the maximum complete multipartite subgraph problem (Q2583129) (← links)
- Note on separation from membership, and folklore (Q2638377) (← links)
- On the equivalence between some discrete and continuous optimization problems (Q2640444) (← links)
- Colouring series-parallel graphs (Q2640612) (← links)
- On additive approximate submodularity (Q2672599) (← links)
- An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
- Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model (Q2682938) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- 3-colouring \(P_t\)-free graphs without short odd cycles (Q2696271) (← links)
- Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs (Q2696616) (← links)
- Independent Sets in Classes Related to Chair-Free Graphs (Q2795949) (← links)
- Tight Bounds on the Radius of Nonsingularity (Q2803591) (← links)
- Reassembling Trees for the Traveling Salesman (Q2806177) (← links)
- Optimal edge-coloring with edge rate constraints (Q2811307) (← links)
- Better Bin Packing Approximations via Discrepancy Theory (Q2816297) (← links)
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880) (← links)
- Covering Intersecting Bi-set Families under Matroid Constraints (Q2820858) (← links)
- On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming (Q2821802) (← links)
- The Stable Fixtures Problem with Payments (Q2827801) (← links)
- Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time (Q2827803) (← links)
- On Robust Solutions to Uncertain Linear Complementarity Problems and their Variants (Q2828336) (← links)
- Lovász-Schrijver PSD-Operator on Claw-Free Graphs (Q2835662) (← links)
- On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (Q2840514) (← links)
- Near-perfect graphs with polyhedral (Q2840742) (← links)
- (Q2857431) (← links)
- (Q2861525) (← links)
- Clique and chromatic number of circular-perfect graphs (Q2883567) (← links)
- Cross line and column generation for the cut covering problem in wireless networks (Q2883571) (← links)
- The complexity of the node capacitated in-tree packing problem (Q2892141) (← links)
- Complexity of column generation in network design with path-based survivability mechanisms (Q2892152) (← links)
- A Polytope for a Product of Real Linear Functions in 0/1 Variables (Q2897309) (← links)
- Are Stable Instances Easy? (Q2911066) (← links)
- Parameterized Weighted Containment (Q2946752) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Multilinear Games (Q2959817) (← links)
- Constructive Discrepancy Minimization for Convex Sets (Q2968153) (← links)
- LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
- Characterizing N+-perfect line graphs (Q2968506) (← links)
- Batch Coloring of Graphs (Q2971156) (← links)
- Graphic Submodular Function Minimization: A Graphic Approach and Applications (Q2971617) (← links)
- On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming (Q2971619) (← links)
- The fundamental theorem of linear programming: extensions and applications (Q2996803) (← links)
- Submodular Function Minimization under a Submodular Set Covering Constraint (Q3010395) (← links)
- Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions (Q3010396) (← links)