Non delayed relax-and-cut algorithms
type: Item
instance of: scholarly article
title: Non delayed relax-and-cut algorithms
zbMATH Open document ID: 1091.90082
author: Abilio Lucena
published in: Annals of Operations Research
publication date: 2006-03-07T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5009790
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: relax-and-cut
zbMATH Keywords: valid constraints
zbMATH Keywords: dual bound strengthening
describes a project that uses: CPLEX
describes a project that uses: XPRESS
describes a project that uses: DIP
MaRDI profile type: Publication
full work available at URL: s10479-005-3977-1
OpenAlex ID: W2016379692
cites work: A restricted Lagrangean approach to the traveling salesman problem
cites work: The volume algorithm: Producing primal solutions with a subgradient method
cites work: Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
cites work: An SST-based algorithm for the steiner problem in graphs
cites work: Lagrangean heuristics for location problems
cites work: Dynamic bundle methods
cites work: Optimal rectangular partitions
cites work: A branch and cut method for the degree-constrained minimum spanning tree problem
cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
cites work: EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING
cites work: Matroids and the greedy algorithm
cites work: A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Q4198056
cites work: The Steiner tree polytope and related polyhedra
cites work: A new approach to the maximum-flow problem
cites work: Q5645210
cites work: Lagrangean relaxation. (With comments and rejoinder).
cites work: Validation of subgradient optimization
cites work: A Lagrangian relaxation approach to the edge-weighted clique problem
cites work: Steiner tree problems
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Integer Programming and Combinatorial Optimization
cites work: A branch and cut algorithm for the Steiner problem in graphs
cites work: Q3760270
cites work: Tree polytope on 2-trees
cites work: Stronger \(K\)-tree relaxations for the vehicle routing problem
cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: Decomposition and dynamic cut generation in integer linear programming
cites work: On finding steiner vertices
cites work: A hybrid GRASP with perturbations for the Steiner problem in graphs
cites work: Edge exchanges in the degree-constrained minimum spanning tree problem
cites work: Q3874241
cites work: Steiner problem in networks: A survey
DOI: 10.1007/S10479-005-3977-1
description: scientific article; zbMATH DE number 5009790