Pages that link to "Item:Q1309040"
From MaRDI portal
The following pages link to Geometric algorithms and combinatorial optimization. (Q1309040):
Displaying 50 items.
- The stable fixtures problem with payments (Q1651275) (← links)
- Testing probabilistic models of choice using column generation (Q1652625) (← links)
- On imposing connectivity constraints in integer programs (Q1683690) (← links)
- Enumeration of 2-level polytopes (Q1741129) (← links)
- Improved bounds on the diameter of lattice polytopes (Q1747971) (← links)
- Polynomial-time algorithms for computing distances of fuzzy transition systems (Q1749476) (← links)
- On exact and approximate stochastic dominance strategies for portfolio selection (Q1751812) (← links)
- A note on non-degenerate integer programs with small sub-determinants (Q1755835) (← links)
- Quantitative evaluation of time-dependent Petri nets and applications to biochemical networks (Q1761679) (← links)
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
- Polynomial inequalities representing polyhedra (Q1777221) (← links)
- Robust sample average approximation (Q1785199) (← links)
- The fairest core in cooperative games with transferable utilities (Q1785318) (← links)
- A new distributed approximation algorithm for the maximum weight independent set problem (Q1793873) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- Cutting-plane proofs in polynomial space (Q1813835) (← links)
- Noisy Chinese remaindering in the Lee norm (Q1827579) (← links)
- Graph-theoretical properties of parallelism in the digital plane (Q1861556) (← links)
- On a positive semidefinite relaxation of the cut polytope (Q1894508) (← links)
- Robust ranking and portfolio optimization (Q1926870) (← links)
- Ideals of graph homomorphisms (Q1950425) (← links)
- Structural aspects of ordered polymatroids (Q1962039) (← links)
- Sandwich theorems and capacity bounds for non-commutative graphs (Q2005181) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Exact solution algorithms for the maximum flow problem with additional conflict constraints (Q2023909) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
- Noisy polynomial interpolation modulo prime powers (Q2034569) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs (Q2061900) (← links)
- Generalized Greenberger-Horne-Zeilinger arguments from quantum logical analysis (Q2062524) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
- Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) (Q2087770) (← links)
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- Robust inventory problem with budgeted cumulative demand uncertainty (Q2091209) (← links)
- Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms (Q2096952) (← links)
- A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← links)
- Dynamic node packing (Q2097666) (← links)
- On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
- Point partition numbers: perfect graphs (Q2115144) (← links)
- A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
- Optimal patchings for consecutive ones matrices (Q2125569) (← links)
- Notes on \(\{a,b,c\}\)-modular matrices (Q2135088) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion (Q2149611) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
