Pages that link to "Item:Q1309040"
From MaRDI portal
The following pages link to Geometric algorithms and combinatorial optimization. (Q1309040):
Displaying 50 items.
- König graphs for 3-paths and 3-cycles (Q266789) (← links)
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- Recognizing Hamming graphs in linear time and space (Q287143) (← links)
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (Q312488) (← links)
- Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory (Q314827) (← links)
- Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions (Q325382) (← links)
- Checking strict positivity of Kraus maps is NP-hard (Q344532) (← links)
- Polytopes of minimum positive semidefinite rank (Q377501) (← links)
- A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars (Q396602) (← links)
- Combinatorial optimization with one quadratic term: spanning trees and forests (Q406320) (← links)
- Coloring fuzzy circular interval graphs (Q412282) (← links)
- Compression bounds for Lipschitz maps from the Heisenberg group to \(L_{1}\) (Q416849) (← links)
- Space-efficient scheduling of stochastically generated tasks (Q418125) (← links)
- Tight lower bounds for halfspace range searching (Q420572) (← links)
- Online variable-sized bin packing with conflicts (Q429693) (← links)
- Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient (Q438742) (← links)
- Some efficiently solvable problems over integer partition polytopes (Q476314) (← links)
- On the maximum acyclic subgraph problem under disjunctive constraints (Q477599) (← links)
- A Euclid style algorithm for MacMahon's partition analysis (Q482232) (← links)
- Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
- Epsilon-net method for optimizations over separable states (Q496030) (← links)
- On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data (Q508691) (← links)
- An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
- A fast space-decomposition scheme for nonconvex eigenvalue optimization (Q526388) (← links)
- Min-max-min robust combinatorial optimization (Q526823) (← links)
- An improved semidefinite programming hierarchy for testing entanglement (Q529619) (← links)
- Minimal containment under homothetics: a simple cutting plane approach (Q535290) (← links)
- A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization (Q631100) (← links)
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems (Q644908) (← links)
- Scheduling of uniform parallel machines with s-precedence constraints (Q646123) (← links)
- A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
- Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
- A cost-aggregating integer linear program for motif finding (Q655435) (← links)
- The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- On the max coloring problem (Q690449) (← links)
- Ear decomposition for pair comparison data (Q696936) (← links)
- Aggregate operators in constraint query languages (Q696963) (← links)
- An improved approximation algorithm for the partial Latin square extension problem. (Q703265) (← links)
- Computability in linear algebra (Q703545) (← links)
- Small Littlewood-Richardson coefficients (Q737966) (← links)
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
- Tropical varieties for exponential sums (Q785323) (← links)
- Satgraphs and independent domination. I (Q818113) (← links)
- A linear optimization oracle for zonotope computation (Q824329) (← links)
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (Q833572) (← links)
- Competitive online multicommodity routing (Q839644) (← links)
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332) (← links)
