Pages that link to "Item:Q1854113"

The following pages link to Combinatorial optimization. Polyhedra and efficiency (3 volumes) (Q1854113):

Displaying 29 items.

• Equistarable bipartite graphs (Q279223) (← links)
• On the diameter of lattice polytopes (Q282757) (← links)
• Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
• On discrete optimization with ordering (Q367635) (← links)
• Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
• Paths, trees and matchings under disjunctive constraints (Q643009) (← links)
• Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
• The affine representation theorem for abstract convex geometries (Q705549) (← links)
• Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
• Combinatorial optimization with 2-joins (Q765197) (← links)
• Packing six \(T\)-joins in plane graphs (Q896004) (← links)
• Generating cut conjunctions in graphs and related problems (Q930604) (← links)
• An algorithm to increase the node-connectivity of a digraph by one (Q955325) (← links)
• On Kalai's conjectures concerning centrally symmetric polytopes (Q1017921) (← links)
• Uniqueness of equilibria in atomic splittable polymatroid congestion games (Q1631639) (← links)
• The search value of a set (Q1699127) (← links)
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
• Generating subtour elimination constraints for the TSP from pure integer solutions (Q2358189) (← links)
• The vertex \(k\)-cut problem (Q2419357) (← links)
• Approximating clique-width and branch-width (Q2496203) (← links)
• Capacitated Vehicle Routing with Nonuniform Speeds (Q2800377) (← links)
• Optimal monotone relabelling of partially non-monotone ordinal data (Q2885460) (← links)
• Incremental Network Design with Minimum Spanning Trees (Q2971398) (← links)
• Locating Depots for Capacitated Vehicle Routing (Q3088097) (← links)
• Some remarks about factors of graphs (Q5387016) (← links)
• Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925) (← links)
• A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization (Q5741072) (← links)
• Parameterized shifted combinatorial optimization (Q5915595) (← links)
• Approximate core allocations for edge cover games (Q6122606) (← links)