Pages that link to "Item:Q1210712"
From MaRDI portal
The following pages link to Geometric algorithms and combinatorial optimization (Q1210712):
Displayed 50 items.
- 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)
- Inductively inferring valid logical models of continuous-state dynamical systems (Q673881) (← 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)
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← 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)
- An algorithmic theory of learning: robust concepts and random projection (Q851862) (← links)
- A construction for non-rank facets of stable set polytopes of webs (Q852709) (← links)
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Strengthened semidefinite programming bounds for codes (Q868466) (← links)
- On the bin packing problem with a fixed number of object weights (Q872247) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- A characterization of Delsarte's linear programming bound as a ratio bound (Q876308) (← links)
- Budget constrained minimum cost connected medians (Q876728) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- Approximation algorithms for extensible bin packing (Q880529) (← links)
- Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm (Q909582) (← links)
- Analyzing the Held-Karp TSP bound: A monotonicity property with application (Q912624) (← links)
- A generalization of the integer linear infeasibility problem (Q924629) (← links)
- Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
- Combinatorial optimization problems in wireless switch design (Q926564) (← links)
- Semidefinite programming and arithmetic circuit evaluation (Q943844) (← links)
- Clique-circulants and the stable set polytope of fuzzy circular interval graphs (Q948961) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- Precoloring extension of co-Meyniel graphs (Q995757) (← links)
- Submodular function minimization (Q995782) (← links)
- Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
- Gear composition and the stable set polytope (Q1003487) (← links)
- Minimizing the stabbing number of matchings, trees, and triangulations (Q1006396) (← links)
- Optimization over the polyhedron determined by a submodular function on a co-intersecting family (Q1116890) (← links)
- A note on compact graphs (Q1174181) (← links)
- Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces (Q1182991) (← links)