Pages that link to "Item:Q1210712"
From MaRDI portal
The following pages link to Geometric algorithms and combinatorial optimization (Q1210712):
Displaying 50 items.
- Polynomial time recognition of essential graphs having stability number equal to matching number (Q497363) (← links)
- Towards more practical linear programming-based techniques for algorithmic mechanism design (Q506527) (← links)
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
- An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
- Computing lower bounds on basket option prices by discretizing semi-infinite linear programming (Q518129) (← links)
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- On the barrier graph of an arrangement of ray sensors (Q528551) (← links)
- Equal-need sharing of a network under connectivity constraints (Q536106) (← links)
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676) (← links)
- Improving an upper bound on the stability number of a graph (Q556012) (← links)
- Some new hereditary classes where graph coloring remains NP-hard (Q556851) (← links)
- Flow metrics (Q596135) (← links)
- Advertisement allocation for generalized second-pricing schemes (Q614045) (← links)
- Knapsack problem with probability constraints (Q628737) (← links)
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme (Q632686) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- Competitive evaluation of threshold functions in the priced information model (Q646704) (← links)
- On prime inductive classes of graphs (Q648987) (← links)
- A set partitioning reformulation of a school bus scheduling problem (Q657252) (← links)
- Fast computation of minimal elementary decompositions of metabolic flux vectors (Q665165) (← links)
- On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
- Inductively inferring valid logical models of continuous-state dynamical systems (Q673881) (← links)
- Perfect matching and polymatroids (Q681726) (← links)
- Computing the volume, counting integral points, and exponential sums (Q685177) (← links)
- How hard is half-space range searching? (Q685178) (← links)
- On existence theorems (Q686508) (← links)
- A scaling technique for finding the weighted analytic center of a polytope (Q687084) (← links)
- The even and odd cut polytopes (Q688256) (← links)
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (Q689144) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- A note on submodular function minimization with covering type linear constraints (Q722536) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- Parallel Cholesky-based reduction for the weighted integer least squares problem (Q727439) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect (Q740644) (← links)
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (Q740647) (← links)
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Dynamic programming bi-criteria combinatorial optimization (Q777429) (← links)
- Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970) (← links)
- Bimonotone linear inequalities and sublattices of \(\mathbb R^n\) (Q817640) (← links)
- The Van der Waerden conjecture for mixed discriminants (Q818049) (← links)
