Pages that link to "Item:Q1210712"
From MaRDI portal
The following pages link to Geometric algorithms and combinatorial optimization (Q1210712):
Displayed 50 items.
- Weak \(k\)-majorization and polyhedra (Q1290598) (← links)
- Minimizing symmetric submodular functions (Q1290631) (← links)
- Two-best solutions under distance constraints: The model and exemplary results for matroids (Q1291060) (← links)
- Test sets of integer programs (Q1298753) (← links)
- Stable sets and polynomials (Q1313833) (← links)
- The computational complexity of knot and matroid polynomials (Q1313843) (← links)
- A unifying location model on tree graphs based on submodularity property (Q1314341) (← links)
- A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
- A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434) (← links)
- Directed Steiner problems with connectivity constraints (Q1315992) (← links)
- The maximum clique problem (Q1318271) (← links)
- Laplacian eigenvalues and the maximum cut problem (Q1319025) (← links)
- On the expected number of \(k\)-sets (Q1327450) (← links)
- Computing the Ehrhart polynomial of a convex lattice polytope (Q1330880) (← links)
- Approximations for the maximum acyclic subgraph problem (Q1332750) (← links)
- Minimum cost multiflows in undirected networks (Q1337137) (← links)
- Solving \(0/1\) integer programs with enumeration cutting planes (Q1339119) (← links)
- Characterizing consistency in probabilistic logic for a class of Horn clauses (Q1340063) (← links)
- Extreme convex set functions with many nonnegative differences (Q1343261) (← links)
- A branch bound method for subset sum problem (Q1343509) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Weighted fractional and integral \(k\)-matching in hypergraphs (Q1346702) (← links)
- How to tidy up a symmetric set-system by use of uncrossing operations (Q1351503) (← links)
- Utility function programs and optimization over the efficient set in multiple-objective decision making (Q1356096) (← links)
- Order preserving assignments without contiguity (Q1356521) (← links)
- On the complexity of testing membership in the core of min-cost spanning tree games (Q1365002) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- Tight approximations for resource constrained scheduling and bin packing (Q1372745) (← links)
- Multiflows and disjoint paths of minimum total cost (Q1373749) (← links)
- A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball (Q1376264) (← links)
- Complexity of searching an immobile hider in a graph (Q1377669) (← links)
- Minimum weight \((T,d)\)-joins and multi-joins (Q1381848) (← links)
- Polyhedral characterizations and perfection of line graphs (Q1382259) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- Minimization of an M-convex function (Q1392577) (← links)
- A note on Schrijver's submodular function minimization algorithm. (Q1400972) (← links)
- On tiling under tomographic constraints. (Q1401222) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Packing cycles in graphs (Q1403928) (← links)
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
- The task allocation problem with constant communication. (Q1408823) (← links)
- A push-relabel framework for submodular function minimization and applications to parametric optimization (Q1410685) (← links)
- Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593) (← links)
- Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. (Q1417599) (← links)
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (Q1421475) (← links)
- Selected papers in honor of Manuel Blum on the occasion of his 60th birthday. Selected papers from the international conference in Theoretical Computer Science, Hong Kong, April 20-24, 1998 (Q1572590) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- The toughness of split graphs (Q1584388) (← links)
- On one maximum multiflow problem and related metrics (Q1584451) (← links)