scientific article; zbMATH DE number 2084783
From MaRDI portal
Publication:4735941
Recommendations
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- Minimum T-cuts and optimal T-pairings
- Extended formulations for the \(A\)-cut problem
- A constrained minimum cost \(s\)-\(t\) cutset problem
- On structural parameterizations of the matching cut problem
- On packing \(T\)-cuts
- A paradigm for listing \((s,t)\)-cuts in graphs
- A constraint programming approach to cutset problems
- scientific article; zbMATH DE number 2050721
Cited in
(35)- On the graphical relaxation of the symmetric traveling salesman polytope
- A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
- Dubins traveling salesman problem with neighborhoods: a graph-based approach
- A branch and cut solver for the maximum stable set problem
- Generating subtour elimination constraints for the TSP from pure integer solutions
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
- Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem
- Properties of bundle valuations in carrier collaboration
- On the facial structure of symmetric and graphical traveling salesman polyhedra
- Further results on an abstract model for branching and its application to mixed integer programming
- A cutting plane procedure for the travelling salesman problem on road networks
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Modeling and solving the two-level generalized median tour problem
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- The strength of multi-row models
- Local cuts for mixed-integer programming
- On the exact separation of mixed integer knapsack cuts
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Finding the right cutting planes for the TSP
- Local cuts revisited
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- On the domino-parity inequalities for the STSP
- Multi-goal motion planning using traveling salesman problem in belief space
- A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone
- Three enhancements for optimization-based bound tightening
- Lifting, tilting and fractional programming revisited
- scientific article; zbMATH DE number 7455732 (Why is no real title available?)
- Decomposition and dynamic cut generation in integer linear programming
- Efficient filtering for the resource-cost alldifferent constraint
- Engineering branch-and-cut algorithms for the equicut problem
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Generating partitions of a graph into a fixed number of minimum weight cuts
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4735941)
