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.
- Recognizing bull-free perfect graphs (Q1895822) (← links)
- On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions (Q1904713) (← links)
- Minimizing submodular functions over families of sets (Q1906848) (← links)
- Extended formulations for the \(A\)-cut problem (Q1915806) (← links)
- Strongly polynomial simplex algorithm for bipartite vertex packing (Q1917242) (← links)
- Restrictions and preassignments in preemptive open shop scheduling (Q1917354) (← links)
- \(\varepsilon\)-approximation minimization of convex functions in fixed dimension (Q1919184) (← links)
- Long range planning in the process industries: A projection approach (Q1919201) (← links)
- Algorithms for synthesizing mechanical systems with maximal natural frequencies (Q1926188) (← links)
- Computational geometric approach to submodular function minimization for multiclass queueing systems (Q1926646) (← links)
- 3-colouring AT-free graphs in polynomial time (Q1934316) (← links)
- State partitioning based linear program for stochastic dynamic programs: an invariance property (Q1939695) (← links)
- Portfolio selection under model uncertainty: a penalized moment-based optimization approach (Q1955553) (← links)
- Perfect \((0,\pm 1)\)-matrices and perfect bidirected graphs (Q1978718) (← links)
- Generalized skew bisubmodularity: a characterization and a min-max theorem (Q2339806) (← links)
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes (Q2345603) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- Efficient algorithms for privately releasing marginals via convex relaxations (Q2349860) (← links)
- The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
- Variable and value elimination in binary constraint satisfaction via forbidden patterns (Q2353394) (← links)
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460) (← links)
- On the independent dominating set polytope (Q2368719) (← links)
- Chromatic characterization of biclique covers (Q2368922) (← links)
- The story of perfectly orderable graphs (Q2373439) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- On the approximability of adjustable robust convex optimization under uncertainty (Q2392812) (← links)
- Optimal allocation of stock levels and stochastic customer demands to a capacitated resource (Q2393464) (← links)
- On the dominating set polytope (Q2426444) (← links)
- The master equality polyhedron with multiple rows (Q2429471) (← links)
- A polyhedral approach to the \textit{alldifferent} system (Q2429475) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- On the theta number of powers of cycle graphs (Q2439827) (← links)
- The complexity of LSH feasibility (Q2440169) (← links)
- An entire space polynomial-time algorithm for linear programming (Q2442633) (← links)
- A note on the Cornaz-Jost transformation to solve the graph coloring problem (Q2444903) (← links)
- An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem (Q2450741) (← links)
- Chromatic Gallai identities operating on Lovász number (Q2452384) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- Series-parallel graphs are windy postman perfect (Q2476276) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- On classes of minimal circular-imperfect graphs (Q2482095) (← links)
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs (Q2482103) (← links)
- Fractionally total colouring \(G_{n,p}\) (Q2482106) (← links)
- Modeling and solving the periodic maintenance problem (Q2488905) (← links)
- Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
- Strong formulations of robust mixed 0-1 programming (Q2502200) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation (Q2506819) (← links)