Non delayed relax-and-cut algorithms
From MaRDI portal
Publication:817212
DOI10.1007/s10479-005-3977-1zbMath1091.90082OpenAlexW2016379692MaRDI QIDQ817212
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-3977-1
Related Items
A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem ⋮ A relax-and-cut framework for large-scale maximum weight connected subgraph problems ⋮ Lower bounds and exact algorithms for the quadratic minimum spanning tree problem ⋮ Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem ⋮ Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem ⋮ A relax-and-cut algorithm for the set partitioning problem ⋮ Fixed cardinality stable sets ⋮ Exact algorithms for the vertex separator problem in graphs ⋮ A relax-and-cut framework for Gomory mixed-integer cuts ⋮ Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem ⋮ Exact solution approaches for the multi-period degree constrained minimum spanning tree problem ⋮ Lagrangian heuristics for the quadratic knapsack problem ⋮ The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope ⋮ A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs ⋮ A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times ⋮ OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Edge exchanges in the degree-constrained minimum spanning tree problem
- The Steiner tree polytope and related polyhedra
- Tree polytope on 2-trees
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- The volume algorithm: Producing primal solutions with a subgradient method
- Lagrangean heuristics for location problems
- Stronger \(K\)-tree relaxations for the vehicle routing problem
- Lagrangean relaxation. (With comments and rejoinder).
- Dynamic bundle methods
- Decomposition and dynamic cut generation in integer linear programming
- A branch and cut method for the degree-constrained minimum spanning tree problem
- A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- On finding steiner vertices
- Steiner problem in networks: A survey
- A new approach to the maximum-flow problem
- An SST-based algorithm for the steiner problem in graphs
- A restricted Lagrangean approach to the traveling salesman problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- A branch and cut algorithm for the Steiner problem in graphs
- EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING
- Validation of subgradient optimization
- Optimal rectangular partitions
- Matroids and the greedy algorithm
- Integer Programming and Combinatorial Optimization
- A Lagrangian relaxation approach to the edge-weighted clique problem
- Steiner tree problems
