Pages that link to "Item:Q5915844"
From MaRDI portal
The following pages link to Combinatorial optimization. Theory and algorithms (Q5915844):
Displaying 50 items.
- Minimum cuts in geometric intersection graphs (Q827339) (← links)
- The dynamic team forming problem: throughput and delay for unbiased policies (Q847121) (← links)
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix (Q1646575) (← links)
- Facets of the dynamic monopoly polytope: linear ordering formulation (Q2042076) (← links)
- A two-step method for solving vector optimization problems on permutation configuration (Q2044039) (← links)
- The linkedness of cubical polytopes: the cube (Q2049620) (← links)
- Feasibility criteria for high-multiplicity partitioning problems (Q2069802) (← links)
- General restricted inverse assignment problems under \(l_1\) and \(l_{\infty}\) norms (Q2082216) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- Randomized shortest paths with net flows and capacity constraints (Q2127057) (← links)
- Approximation algorithms for the \(k\)-depots Hamiltonian path problem (Q2128771) (← links)
- Matroid bases with cardinality constraints on the intersection (Q2149563) (← links)
- On computational capabilities of Ising machines based on nonlinear oscillators (Q2150420) (← links)
- An approximation algorithm for solving the heterogeneous Chinese postman problem (Q2151360) (← links)
- Two dimensional maximum weight matching using Manhattan topology (Q2157895) (← links)
- Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes (Q2208245) (← links)
- On a weighted linear matroid intersection algorithm by deg-det computation (Q2227314) (← links)
- Local search with a SAT oracle for combinatorial optimization (Q2233496) (← links)
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
- Extended random assignment mechanisms on a family of good sets (Q2241324) (← links)
- Trouble comes in threes: core stability in minimum cost connection networks (Q2242222) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- Some conditions for the existence of Euler \(H\)-trails (Q2334082) (← links)
- Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization (Q2356258) (← links)
- Finding optimal non-datapath caching strategies via network flow (Q2682921) (← links)
- Approximation algorithms for multi-vehicle stacker crane problems (Q2687683) (← links)
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (Q2699031) (← links)
- Learning Control Sets for Lattice Planners from User Preferences (Q3381986) (← links)
- Swapping Colored Tokens on Graphs (Q3449858) (← links)
- A Tractable Class of Binary VCSPs via M-Convex Intersection (Q4972691) (← links)
- A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage (Q4973250) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments (Q5009617) (← links)
- A dichotomy result for cyclic-order traversing games (Q5091020) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
- Chain Rule Optimal Transport (Q5153518) (← links)
- Optimization Methods: An Applications-Oriented Primer (Q5154449) (← links)
- The Multiplex Decomposition: An Analytic Framework for Multilayer Dynamical Networks (Q5164901) (← links)
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings (Q5234537) (← links)
- The maximum 1-2 matching problem and two kinds of its variants (Q5242821) (← links)
- Reducing Path TSP to TSP (Q5860476) (← links)
- Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918581) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- A new contraction technique with applications to congruency-constrained cuts (Q5918921) (← links)
- Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost (Q6053958) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- A practitioner’s guide to quantum algorithms for optimisation problems (Q6063352) (← links)
- On matchings, <i>T</i>‐joins, and arc routing in road networks (Q6065851) (← links)
- Combinatorial acyclicity models for potential‐based flows (Q6065854) (← links)
- Min‐sum controllable risk problems with concave risk functions of the same value range (Q6065855) (← links)
- Optimal sufficient requirements on the embedded Ising problem in polynomial time (Q6073965) (← links)
