Pages that link to "Item:Q922927"

The following pages link to An efficient algorithm for the minimum capacity cut problem (Q922927):

Displaying 29 items.

• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• Simplifying maximum flow computations: the effect of shrinking and good initial flows (Q411873) (← links)
• Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
• A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants (Q716345) (← links)
• Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
• Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
• The traveling purchaser problem with budget constraint (Q1013406) (← links)
• Minimizing symmetric submodular functions (Q1290631) (← links)
• A branch-and-cut algorithm for vehicle routing problems (Q1339118) (← links)
• Minimum cut problem using bases of extended polymatroids (Q1385774) (← links)
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. (Q1406627) (← links)
• Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
• The traveling salesman problem with draft limits (Q1761142) (← links)
• Implementing an efficient minimum capacity cut algorithm (Q1804650) (← links)
• On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
• Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← links)
• Generating subtour elimination constraints for the TSP from pure integer solutions (Q2358189) (← links)
• A distributed exact algorithm for the multiple resource constrained sequencing problem (Q2368093) (← links)
• Exact solutions to linear programming problems (Q2467437) (← links)
• A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation (Q3057179) (← links)
• Minimum Cuts of Simple Graphs in Almost Always Linear Time (Q3605499) (← links)
• Practical Minimum Cut Algorithms (Q4629534) (← links)
• TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration (Q5090297) (← links)
• (Q5111689) (← links)
• Branch and cut methods for network optimization (Q5936762) (← links)
• A matheuristic algorithm for the pollution and energy minimization traveling salesman problems (Q6079856) (← links)
• Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem (Q6551080) (← links)
• Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming (Q6645186) (← links)