Pages that link to "Item:Q1210712"
From MaRDI portal
The following pages link to Geometric algorithms and combinatorial optimization (Q1210712):
Displayed 50 items.
- Semidefinite programming (Q1600854) (← links)
- A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- Short vectors of planar lattices via continued fractions (Q1603456) (← links)
- Query by committee, linear separation and random walks. (Q1603591) (← links)
- A polynomial-time algorithm for the bistable roommates problem (Q1604203) (← links)
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem (Q1607016) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- Totally tight Chvatal-Gomory cuts (Q1612006) (← links)
- K-submodular functions and convexity of their Lovász extension (Q1613409) (← links)
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
- On a general framework for network representability in discrete optimization (Q1631628) (← links)
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints (Q1652440) (← links)
- Computing and estimating the volume of the solution space of SMT(LA) constraints (Q1659994) (← links)
- A polynomial projection-type algorithm for linear programming (Q1667181) (← links)
- Revisiting \(k\)-sum optimization (Q1675256) (← links)
- Reformulation of the linear program for completely ergodic MDPs with average cost criteria (Q1676496) (← links)
- A convex programming-based algorithm for mean payoff stochastic games with perfect information (Q1686541) (← links)
- Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- Dimensionality reduction of SDPs through sketching (Q1713333) (← links)
- Complex-demand scheduling problem with application in smart grid (Q1727389) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
- Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling (Q1746610) (← links)
- A semidefinite programming method for integer convex quadratic minimization (Q1749779) (← links)
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
- Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
- Feasibility recovery for the unit-capacity constrained permutation problem (Q1751174) (← links)
- On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs (Q1751184) (← links)
- The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- Collaborative replenishment in the presence of intermediaries (Q1754069) (← links)
- Robust multicovers with budgeted uncertainty (Q1755380) (← links)
- Saving colors and max coloring: some fixed-parameter tractability results (Q1755584) (← links)
- Approximation algorithms for the max-buying problem with limited supply (Q1755724) (← links)
- On the mean radius of permutation polytopes (Q1765513) (← links)
- Biased positional games on matroids (Q1765611) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- Integer convex minimization by mixed integer linear optimization (Q1785273) (← links)
- On the lattice programming gap of the group problems (Q1785637) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- Complexity and approximations for submodular minimization problems on two variables per inequality constraints (Q1801066) (← links)
- Probing polygons minimally is hard (Q1803270) (← links)
- A random polynomial time algorithm for well-routing convex bodies (Q1805452) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)