Pages that link to "Item:Q1309040"
From MaRDI portal
The following pages link to Geometric algorithms and combinatorial optimization. (Q1309040):
Displaying 50 items.
- Vaidya's method for convex stochastic optimization problems in small dimension (Q2170511) (← links)
- On tail dependence matrices. The realization problem for parametric families (Q2191424) (← links)
- Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm (Q2192028) (← links)
- A polynomial algorithm for minimizing discrete convic functions in fixed dimension (Q2192061) (← links)
- Unconditional reflexive polytopes (Q2197693) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Approximation algorithms for energy-efficient scheduling of parallel jobs (Q2215201) (← links)
- Scheduling split intervals with non-uniform demands (Q2218651) (← links)
- Generalized Littlewood-Richardson coefficients for branching rules of \(\mathrm{GL}(n)\) and extremal weight crystals (Q2219301) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- Tropical Ehrhart theory and tropical volume (Q2221527) (← links)
- A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
- Extremal general affine surface areas (Q2235948) (← links)
- Preemptive and non-preemptive generalized min sum set cover (Q2248757) (← links)
- Subgroups generated by rational functions in finite fields (Q2255262) (← links)
- On the computational complexity of weighted voting games (Q2268913) (← links)
- A convex optimisation framework for the unequal-areas facility layout problem (Q2275810) (← links)
- Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) (← links)
- An oracle for the discrete-time integral quadratic constraint problem (Q2280816) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- Vanishing of Littlewood-Richardson polynomials is in P (Q2311547) (← links)
- Polynomial size linear programs for problems in \textsc{P} (Q2312647) (← links)
- On fractional cut covers (Q2312658) (← links)
- Polymatroid-based capacitated packing of branchings (Q2334055) (← links)
- A new parallel lattice reduction algorithm for BKZ reduced bases (Q2335926) (← links)
- Enforcing efficient equilibria in network design games via subsidies (Q2345938) (← links)
- Suppression distance computation for hierarchical clusterings (Q2346561) (← links)
- Convex generalized flows (Q2352786) (← links)
- Rank-one quantum games (Q2353189) (← links)
- Note on maximal split-stable subgraphs (Q2381823) (← links)
- Complexity of integer quasiconvex polynomial optimization (Q2387421) (← links)
- Packing Steiner trees with identical terminal sets (Q2390272) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- A space decomposition scheme for maximum eigenvalue functions and its applications (Q2407989) (← links)
- Solving generic nonarchimedean semidefinite programs using stochastic game algorithms (Q2409007) (← links)
- Alternatives for testing total dual integrality (Q2429472) (← links)
- Complete description for the spanning tree problem with one linearised quadratic term (Q2450761) (← links)
- On the frontiers of polynomial computations in tropical geometry (Q2457404) (← links)
- On the complexity of 4-coloring graphs without long induced paths (Q2465649) (← links)
- On the symmetry function of a convex set (Q2467164) (← links)
- Relative blocking in posets (Q2467569) (← links)
- A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs (Q2477698) (← links)
- A new class of facets for the Latin square polytope (Q2492192) (← links)
- A comparison of two different formulations for arc routing problems on mixed graphs (Q2496040) (← links)
- A fast approximation algorithm for solving the complete set packing problem (Q2514810) (← links)
- Quasisymmetric embeddings, the observable diameter, and expansion properties of graphs (Q2573422) (← links)
- Monotone maps, sphericity and bounded second eigenvalue (Q2573647) (← links)
- Permutohedra and minimal matrices (Q2576235) (← links)
- The complexity of partition functions (Q2581263) (← links)
- Network reinforcement (Q2583121) (← links)
