Pages that link to "Item:Q3703653"

The following pages link to Solving matching problems with linear programming (Q3703653):

Displaying 24 items.

• Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
• Solving the minimum label spanning tree problem by mathematical programming techniques (Q666399) (← links)
• Solving (large scale) matching problems combinatorially (Q750322) (← links)
• Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
• Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
• Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
• A cutting plane algorithm for a clustering problem (Q1122492) (← links)
• A polyhedral approach to edge coloring (Q1180838) (← links)
• Euclidean semi-matchings of random samples (Q1184341) (← links)
• Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
• A cutting plane algorithm for the windy postman problem (Q1198736) (← links)
• A branch-and-cut algorithm for vehicle routing problems (Q1339118) (← links)
• The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
• Combinatorial optimization and small polytopes (Q1814809) (← links)
• A cutting plane algorithm for minimum perfect 2-matchings (Q1821798) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
• New primal and dual matching heuristics (Q1891231) (← links)
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
• Cardinality-restricted chains and antichains in partially ordered sets (Q1917285) (← links)
• Ordered weighted average combinatorial optimization: formulations and their properties (Q2449062) (← links)
• The Cutting Plane Method is Polynomial for Perfect Matchings (Q2800362) (← links)
• Efficient Approximation Algorithms for Weighted $b$-Matching (Q2830632) (← links)
• Constraint relaxation for the discrete ordered median problem (Q6081610) (← links)
• The biobjective minimum-cost perfect matching problem and Chinese postman problem (Q6495384) (← links)