Pages that link to "Item:Q3186486"
From MaRDI portal
The following pages link to Integer Programming and Combinatorial Optimization (Q3186486):
Displaying 50 items.
- Matroid and knapsack center problems (Q300451) (← links)
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- Blocking optimal arborescences (Q507342) (← links)
- Lower bounds on the sizes of integer programs without additional variables (Q896270) (← links)
- Submodular maximization meets streaming: matchings, matroids, and more (Q896286) (← links)
- Simple extensions of polytopes (Q896292) (← links)
- Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems (Q1800987) (← links)
- Popular edges and dominant matchings (Q1800997) (← links)
- Extreme functions with an arbitrary number of slopes (Q1801005) (← links)
- Minimal cut-generating functions are nearly extreme (Q1801006) (← links)
- Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
- Strong reductions for extended formulations (Q1801022) (← links)
- Improved approximation algorithms for hitting 3-vertex paths (Q2191773) (← links)
- Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
- On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487) (← links)
- Centerpoints: A Link Between Optimization and Convex Geometry (Q3186488) (← links)
- Rescaled Coordinate Descent Methods for Linear Programming (Q3186489) (← links)
- Max-Cut Under Graph Constraints (Q3186491) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- Intersection Cuts for Bilevel Optimization (Q3186493) (← links)
- Exact Algorithms for the Chance-Constrained Vehicle Routing Problem (Q3186494) (← links)
- Extended Formulations in Mixed-Integer Convex Programming (Q3186495) (← links)
- k-Trails: Recognition, Complexity, and Approximations (Q3186496) (← links)
- Better s-t-Tours by Gao Trees (Q3186497) (← links)
- Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines (Q3186499) (← links)
- Stabilizing Network Bargaining Games by Blocking Players (Q3186500) (← links)
- Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over (Q3186501) (← links)
- On the Mixed Binary Representability of Ellipsoidal Regions (Q3186504) (← links)
- Constant Factor Approximation for ATSP with Two Edge Weights (Q3186505) (← links)
- Improved Approximations for Cubic Bipartite and Cubic TSP (Q3186507) (← links)
- An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation (Q3186508) (← links)
- Valid Inequalities for Separable Concave Constraints with Indicator Variables (Q3186509) (← links)
- A Polyhedral Approach to Online Bipartite Matching (Q3186510) (← links)
- On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank (Q3186511) (← links)
- Robust Monotone Submodular Function Maximization (Q3186512) (← links)
- Submodular Unsplittable Flow on Trees (Q3186514) (← links)
- Approximation-Friendly Discrepancy Rounding (Q3186517) (← links)
- Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point (Q3186518) (← links)
- On the Quantile Cut Closure of Chance-Constrained Problems (Q3186519) (← links)
- An Improved Integrality Gap for Asymmetric TSP Paths (Q3186524) (← links)
- Reverse Chvátal--Gomory Rank (Q3453572) (← links)
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables (Q3503836) (← links)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
- The Air Traffic Flow Management Problem: An Integer Optimization Approach (Q3503838) (← links)
- The Induced Disjoint Paths Problem (Q3503839) (← links)
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs (Q3503840) (← links)
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs (Q3503841) (← links)
- A Polynomial Algorithm for Weighted Abstract Flow (Q3503842) (← links)
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem (Q3503843) (← links)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
