New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802): Difference between revisions

Revision as of 14:12, 1 August 2024

scientific article; zbMATH DE number 7706798

Language	Label	Description	Also known as
English	New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems	scientific article; zbMATH DE number 7706798

Statements

instance of

scholarly article

0 references

title

New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (English)

0 references

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

4 July 2023

0 references

zbMATH Keywords

networks

0 references

OR in telecommunications

0 references

integer programming

0 references

branch-and-cut-and-price

0 references

dynamic programming

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2022.10.001

0 references

cites work

A branch-and-price algorithm for the ring-tree facility location problem

0 references

SCIP: solving constraint integer programs

0 references

An ILP-refined tabu search for the directed profitable rural postman problem

0 references

Heuristic algorithms for the multi-depot ring-star problem

0 references

The Capacitated <i>m</i>-Ring-Star Problem

0 references

Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms

0 references

New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem

0 references

Branch-and-Price: Column Generation for Solving Huge Integer Programs

0 references

Steiner Tree Problems With Profits

0 references

Solving Large-Scale Zero-One Linear Programming Problems

0 references

Column Generation

0 references

An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs

0 references

Benchmarking optimization software with performance profiles.

0 references

The steiner problem in graphs

0 references

Optimum branchings

0 references

SCIP-Jack -- a solver for STP and variants with parallelization extensions

0 references

A catalog of steiner tree formulations

0 references

Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route

0 references

Multi-exchange Neighborhoods for the Capacitated Ring Tree Problem

0 references

Capacitated ring arborescence problems with profits

0 references

Exact algorithms for bi-objective ring tree problems with reliability measures

0 references

Optimal capacitated ring trees

0 references

Generalized local branching heuristics and the capacitated ring tree problem

0 references

A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem

0 references

Shortest Path Problems with Resource Constraints

0 references

Q4952698

0 references

Column Generation based Primal Heuristics

0 references

Reducibility among Combinatorial Problems

0 references

Solving Steiner tree problems in graphs to optimality

0 references

The Ring Star Problem: Polyhedral analysis and exact algorithm

0 references

Locating a cycle in a transportation or a telecommunications network

0 references

The Steiner tree problem with delays: a compact formulation and reduction procedures

0 references

Multistars, partial multistars and the capacitated vehicle routing problem

0 references

Q4452900

0 references

Selected Topics in Column Generation

0 references

A heuristic procedure for the capacitated \(m\)-ring-star problem

0 references

An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem

0 references

Q4040221

0 references

A comparison of Steiner tree relaxations

0 references

TSPLIB—A Traveling Salesman Problem Library

0 references

Primal Heuristics for Branch and Price: The Assets of Diving Methods

0 references

Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation

0 references

The Steiner tree problem with hop constraints

0 references

A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems

0 references

Identifiers

DOI

10.1016/j.ejor.2022.10.001

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6109802

@@ Property / cites work @@
+A branch-and-price algorithm for the ring-tree facility location problem
+Normal rank
@@ Property / cites work @@
+SCIP: solving constraint integer programs
@@ Property / cites work: SCIP: solving constraint integer programs / rank @@
+Normal rank
@@ Property / cites work @@
+An ILP-refined tabu search for the directed profitable rural postman problem
+Normal rank
@@ Property / cites work @@
+Heuristic algorithms for the multi-depot ring-star problem
+Normal rank
@@ Property / cites work @@
+The Capacitated <i>m</i>-Ring-Star Problem
@@ Property / cites work: The Capacitated <i>m</i>-Ring-Star Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
+Normal rank
@@ Property / cites work @@
+New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
+Normal rank
@@ Property / cites work @@
+Branch-and-Price: Column Generation for Solving Huge Integer Programs
+Normal rank
@@ Property / cites work @@
+Steiner Tree Problems With Profits
@@ Property / cites work: Steiner Tree Problems With Profits / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Zero-One Linear Programming Problems
+Normal rank
@@ Property / cites work @@
+Column Generation
@@ Property / cites work: Column Generation / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs
+Normal rank
@@ Property / cites work @@
+Benchmarking optimization software with performance profiles.
+Normal rank
@@ Property / cites work @@
+The steiner problem in graphs
@@ Property / cites work: The steiner problem in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum branchings
@@ Property / cites work: Optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+SCIP-Jack -- a solver for STP and variants with parallelization extensions
+Normal rank
@@ Property / cites work @@
+A catalog of steiner tree formulations
@@ Property / cites work: A catalog of steiner tree formulations / rank @@
+Normal rank
@@ Property / cites work @@
+Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
+Normal rank
@@ Property / cites work @@
+Multi-exchange Neighborhoods for the Capacitated Ring Tree Problem
+Normal rank
@@ Property / cites work @@
+Capacitated ring arborescence problems with profits
+Normal rank
@@ Property / cites work @@
+Exact algorithms for bi-objective ring tree problems with reliability measures
+Normal rank
@@ Property / cites work @@
+Optimal capacitated ring trees
@@ Property / cites work: Optimal capacitated ring trees / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized local branching heuristics and the capacitated ring tree problem
+Normal rank
@@ Property / cites work @@
+A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
+Normal rank
@@ Property / cites work @@
+Shortest Path Problems with Resource Constraints
@@ Property / cites work: Shortest Path Problems with Resource Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952698
@@ Property / cites work: Q4952698 / rank @@
+Normal rank
@@ Property / cites work @@
+Column Generation based Primal Heuristics
@@ Property / cites work: Column Generation based Primal Heuristics / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Steiner tree problems in graphs to optimality
+Normal rank
@@ Property / cites work @@
+The Ring Star Problem: Polyhedral analysis and exact algorithm
+Normal rank
@@ Property / cites work @@
+Locating a cycle in a transportation or a telecommunications network
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem with delays: a compact formulation and reduction procedures
+Normal rank
@@ Property / cites work @@
+Multistars, partial multistars and the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Q4452900
@@ Property / cites work: Q4452900 / rank @@
+Normal rank
@@ Property / cites work @@
+Selected Topics in Column Generation
@@ Property / cites work: Selected Topics in Column Generation / rank @@
+Normal rank
@@ Property / cites work @@
+A heuristic procedure for the capacitated \(m\)-ring-star problem
+Normal rank
@@ Property / cites work @@
+An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of Steiner tree relaxations
@@ Property / cites work: A comparison of Steiner tree relaxations / rank @@
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank
@@ Property / cites work @@
+Primal Heuristics for Branch and Price: The Assets of Diving Methods
+Normal rank
@@ Property / cites work @@
+Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem with hop constraints
@@ Property / cites work: The Steiner tree problem with hop constraints / rank @@
+Normal rank
@@ Property / cites work @@
+A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
+Normal rank