Pages that link to "Item:Q1210712"
From MaRDI portal
The following pages link to Geometric algorithms and combinatorial optimization (Q1210712):
Displaying 50 items.
- The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity (Q256627) (← links)
- Regular independent sets (Q260019) (← links)
- PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
- Error bounds for mixed integer linear optimization problems (Q263186) (← links)
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
- Realizing symmetric set functions as hypergraph cut capacity (Q284712) (← links)
- Note on shortest and nearest lattice vectors (Q286988) (← links)
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs (Q290201) (← links)
- A note on minimizing submodular functions (Q293366) (← links)
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
- Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization (Q321039) (← links)
- Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
- A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
- The firefighter problem: empirical results on random graphs (Q337557) (← links)
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
- Colouring perfect graphs with bounded clique number (Q345123) (← links)
- Techniques for exploring the suboptimal set (Q374684) (← links)
- A polyhedral approach to the single row facility layout problem (Q378107) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
- On N. Z. Shor's three scientific ideas (Q380646) (← links)
- Fast recognition of doubled graphs (Q385965) (← links)
- Constructing uniquely realizable graphs (Q393739) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect (Q403365) (← links)
- Improving an upper bound on the size of \(k\)-regular induced subgraphs (Q411262) (← links)
- Packing cycles exactly in polynomial time (Q421271) (← links)
- Vector bin packing with multiple-choice (Q427903) (← links)
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- Network design with weighted degree constraints (Q429670) (← links)
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
- Fractional packing in ideal clutters (Q431029) (← links)
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem (Q434159) (← links)
- Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- On the computational complexity of membership problems for the completely positive cone and its dual (Q461444) (← links)
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- Polyhedral study of the connected subgraph problem (Q468440) (← links)
- Criticality for multicommodity flows (Q473104) (← links)
- Emergency connectivity in ad-hoc networks with selfish nodes (Q476427) (← links)
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach (Q476861) (← links)
- Computational complexity analysis of the sensor location flow observability problem (Q479256) (← links)
- Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints (Q481050) (← links)
- A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
- Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks (Q490355) (← links)
- Computing cooperative solution concepts in coalitional skill games (Q490424) (← links)
- Coloring perfect graphs with no balanced skew-partitions (Q490982) (← links)
- Faster separation of 1-wheel inequalities by graph products (Q496437) (← links)
