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)
- Ranking tournaments with no errors. II: Minimax relation (Q1985451) (← links)
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
- A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- Robust stochastic optimization with convex risk measures: a discretized subgradient scheme (Q2031316) (← links)
- On the complexity of surrogate and group relaxation for integer linear programs (Q2060595) (← links)
- Hardness results for multimarginal optimal transport problems (Q2067496) (← links)
- Total tessellation cover: bounds, hardness, and applications (Q2091795) (← links)
- Submodular function minimization and polarity (Q2097629) (← links)
- Point partition numbers: perfect graphs (Q2115144) (← links)
- Fractional cocoloring of graphs (Q2117529) (← links)
- Optimized Bonferroni approximations of distributionally robust joint chance constraints (Q2118072) (← links)
- Popular branchings and their dual certificates (Q2118146) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs (Q2138579) (← links)
- A new greedy strategy for maximizing monotone submodular function under a cardinality constraint (Q2141724) (← links)
- Book review of: L. Lovász, Graphs and geometry (Q2143334) (← links)
- A LP-based approximation algorithm for generalized traveling salesperson path problem (Q2150585) (← links)
- Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
- A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems (Q2166001) (← links)
- Reachability in arborescence packings (Q2166224) (← links)
- Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
- A linear programming primer: from Fourier to Karmarkar (Q2177789) (← links)
- Postman problems on series-parallel mixed graphs (Q2183202) (← links)
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (Q2191293) (← links)
- Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm (Q2192028) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
- A computational complexity comparative study of graph tessellation problems (Q2222093) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
- Buyer selection and service pricing in an electric fleet supply chain (Q2239895) (← links)
- Hard to solve instances of the Euclidean traveling salesman problem (Q2246186) (← links)
- On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
- On the hardness of designing public signals (Q2278949) (← links)