A relax-and-cut framework for large-scale maximum weight connected subgraph problems
From MaRDI portal
Recommendations
- The Maximum Weight Connected Subgraph Problem
- Solving generalized maximum-weight connected subgraph problem for network enrichment analysis
- Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
- Algorithms for the maximum weight connected \(k\)-induced subgraph problem
- The rooted maximum node-weight connected subgraph problem
Cites work
- scientific article; zbMATH DE number 3677874 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 1926656 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 1445375 (Why is no real title available?)
- scientific article; zbMATH DE number 5173819 (Why is no real title available?)
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
- A facet generation and relaxation technique applied to an assignment problem with side constraints
- A node-based ILP formulation for the node-weighted dominating Steiner problem
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
- A strong lower bound for the Node Weighted Steiner Tree Problem
- Algorithmic expedients for the prize collecting Steiner tree problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Conjugate gradient methods using quasi-Newton updates with inexact line searches
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- Imposing Connectivity Constraints in Forest Planning Models
- Lagrangian Relaxation via Ballstep Subgradient Methods
- Non delayed relax-and-cut algorithms
- On imposing connectivity constraints in integer programs
- Optimal rectangular partitions
- Primal-dual subgradient methods for convex problems
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- Solving Connected Subgraph Problems in Wildlife Conservation
- The Maximum Weight Connected Subgraph Problem
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- The rooted maximum node-weight connected subgraph problem
- Two ``well-known properties of subgradient optimization
Cited in
(9)- Vertex covering with capacitated trees
- Imposing contiguity constraints in political districting models
- Method of the Joint Clustering in Network and Correlation Spaces
- The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Algorithms for the maximum weight connected \(k\)-induced subgraph problem
- On approximating maximum covering cycles in undirected graphs
- The rooted maximum node-weight connected subgraph problem
- Solving generalized maximum-weight connected subgraph problem for network enrichment analysis
This page was built for publication: A relax-and-cut framework for large-scale maximum weight connected subgraph problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652399)
