Pages that link to "Item:Q5915844"

The following pages link to Combinatorial optimization. Theory and algorithms (Q5915844):

Displaying 46 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)
• Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments (Q5009617) (← links)
• A dichotomy result for cyclic-order traversing games (Q5091020) (← 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)
• Strategyproof mechanism for two-sided matching with resource allocation (Q6098859) (← links)
• Coarse-grid selection using simulated annealing (Q6137788) (← links)
• A survey on exact algorithms for the maximum flow and minimum‐cost flow problems (Q6139374) (← links)
• Improving a constructive heuristic for the general routing problem (Q6179705) (← links)
• Linear-size formulations for connected planar graph partitioning and political districting (Q6181361) (← links)
• Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties (Q6181377) (← links)
• On the socle of Artinian algebras associated with graphs (Q6185351) (← links)
• Minor embedding in broken chimera and derived graphs is NP-complete (Q6201320) (← links)
• Approval-based apportionment (Q6201936) (← links)