Pages that link to "Item:Q1309040"

The following pages link to Geometric algorithms and combinatorial optimization. (Q1309040):

Displaying 50 items.

• The wheels of the orthogonal Latin squares polytope: classification and valid inequalities (Q2583175) (← links)
• Unreliable point facility location problems on networks (Q2636810) (← links)
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
• Small Chvátal rank (Q2638380) (← links)
• Convex hulls, oracles, and homology (Q2643561) (← links)
• Effective lattice point counting in rational convex polytopes (Q2643564) (← links)
• On the convexity of independent set games (Q2659079) (← links)
• Attacking the linear congruential generator on elliptic curves via lattice techniques (Q2673768) (← links)
• Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques (Q2675702) (← links)
• Portioning using ordinal preferences: fairness and efficiency (Q2680774) (← links)
• Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model (Q2682938) (← links)
• Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
• The capacitated arc routing problem with intermediate facilities (Q2719845) (← links)
• Matrix convex hulls of free semialgebraic sets (Q2790584) (← links)
• Introduction to Semidefinite, Conic and Polynomial Optimization (Q2802517) (← links)
• Convex Hulls of Algebraic Sets (Q2802521) (← links)
• A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q2817799) (← links)
• A dynamic programming approach for a class of robust optimization problems (Q2817842) (← links)
• The Stable Fixtures Problem with Payments (Q2827801) (← links)
• The computational complexity of duality (Q2832893) (← links)
• Coloring fuzzy circular interval graphs (Q2851514) (← links)
• A characterization of odd-hole inequalities related to Latin squares (Q2868928) (← links)
• A Polytope for a Product of Real Linear Functions in 0/1 Variables (Q2897309) (← links)
• On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
• Ratio and Weight Quantiles (Q2946351) (← links)
• The Mixed Evacuation Problem (Q2958300) (← links)
• Odd Multiway Cut in Directed Acyclic Graphs (Q3300762) (← links)
• Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (Q3419712) (← links)
• Concentration phenomena in high dimensional geometry (Q3451705) (← links)
• A Fast and Practical Method to Estimate Volumes of Convex Polytopes (Q3452552) (← links)
• Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem (Q3512450) (← links)
• Expander graphs and their applications (Q3514498) (← links)
• Short rational generating functions for lattice point problems (Q4419572) (← links)
• Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
• Optimization over Degree Sequences (Q4579955) (← links)
• Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
• Predicting nonlinear pseudorandom number generators (Q4671848) (← links)
• Graph Stabilization: A Survey (Q4689625) (← links)
• (Q4788601) (← links)
• A Heuristic Solution of a Cutting Problem Using Hypergraphs (Q4915264) (← links)
• (Q4915358) (← links)
• (Q4944681) (← links)
• Finding and certifying a large hidden clique in a semirandom graph (Q4948021) (← links)
• Generalized Optimal Matching Methods for Causal Inference (Q4969111) (← links)
• Generalized Center Problems with Outliers (Q4972687) (← links)
• Binary Component Decomposition Part I: The Positive-Semidefinite Case (Q4999392) (← links)
• Symmetric interdiction for matching problems (Q5002612) (← links)
• Quantum generalizations of the polynomial hierarchy with applications to QMA(2) (Q5005160) (← links)
• Newell-Littlewood numbers (Q5009309) (← links)
• Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)