A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants

DOI10.1287/ijoc.2020.0981zbMath1466.90020OpenAlexW3087407760MaRDI QIDQ4995082

Cheng, T. C. Edwin, Qinghua Wu, Andrew E. B. Lim, Hu Qin, Zhi-Xing Luo

Publication date: 23 June 2021

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2020.0981

zbMATH Keywords

dynamic programminglabel-setting algorithmbranch-and-price-and-cutcable routingphotovoltaic power plant

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
• A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• On the capacitated vehicle routing problem
• Parallel branch, cut, and price for large-scale discrete optimization
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
• RAMP for the capacitated minimum spanning tree problem
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• Savings based ant colony optimization for the capacitated minimum spanning tree problem
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• A branch and bound algorithm for the capacitated minimum spanning tree problem
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• A Gentle Introduction to Memetic Algorithms
• Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints
• Column Generation
• Selected Topics in Column Generation
• Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem

This page was built for publication: A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants