A relax-and-cut framework for large-scale maximum weight connected subgraph problems
type: Item
instance of: scholarly article
title: A relax-and-cut framework for large-scale maximum weight connected subgraph problems
zbMATH Open document ID: 1391.90595
author: Eduardo Álvarez-Miranda
author: Markus Sinnl
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 92C42
zbMATH DE Number: 6901475
zbMATH Keywords: maximum weight connected subgraph problem
zbMATH Keywords: Lagrangian pelaxation
zbMATH Keywords: bioinformatics
describes a project that uses: Knapsack
describes a project that uses: igraph
describes a project that uses: BioNet
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: j.cor.2017.05.015
OpenAlex ID: W2618313358
Wikidata QID: Q126130209
cites work: A facet generation and relaxation technique applied to an assignment problem with side constraints
cites work: A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
cites work: The Maximum Weight Connected Subgraph Problem
cites work: The Rooted Maximum Node-Weight Connected Subgraph Problem
cites work: Two ``well-known'' properties of subgradient optimization
cites work: Q4707782
cites work: Q4495496
cites work: A node‐based ILP formulation for the node‐weighted dominating Steiner problem
cites work: Optimal rectangular partitions
cites work: Imposing Connectivity Constraints in Forest Planning Models
cites work: A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
cites work: Solving Connected Subgraph Problems in Wildlife Conservation
cites work: A strong lower bound for the Node Weighted Steiner Tree Problem
cites work: A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
cites work: Efficient cuts in Lagrangean `relax-and-cut' schemes
cites work: The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
cites work: Algorithmic expedients for the prize collecting Steiner tree problem
cites work: Q4952698
cites work: Q4821303
cites work: Lagrangian Relaxation via Ballstep Subgradient Methods
cites work: A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
cites work: Non delayed relax-and-cut algorithms
cites work: Q5294045
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: Q3993418
cites work: Primal-dual subgradient methods for convex problems
cites work: Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
cites work: Conjugate gradient methods using quasi-Newton updates with inexact line searches
cites work: Q3874241
cites work: On imposing connectivity constraints in integer programs
cites work: Q4254875
DOI: 10.1016/J.COR.2017.05.015
description: scientific article; zbMATH DE number 6901475