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

DOI10.1016/j.ejor.2022.10.001OpenAlexW4302363040MaRDI QIDQ6109802

Roberto Baldacci, Alessandro Hill, Edna A. Hoshino

Publication date: 4 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.10.001

zbMATH Keywords

integer programmingdynamic programmingnetworksbranch-and-cut-and-priceOR in telecommunications

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing

Cites Work

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

This page was built for publication: New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems