Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure

DOI10.1007/s11081-021-09621-3zbMath1495.90045OpenAlexW3150387864MaRDI QIDQ2147939

Sean Yaw, Brendan Hoover, Caleb Whitman, Richard Middleton

Publication date: 20 June 2022

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-021-09621-3

zbMATH Keywords

network designcarbon capture and storageinteger linear programfixed charge flow network

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic network models in operations research (90B10) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)

Uses Software

• GitHub
• CostMAP
• SimCCS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global and local search algorithms for concave cost transshipment problems
• An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
• Hybrid meta-heuristic algorithms for solving network design problem
• An algorithm for the min concave cost flow problem
• Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• An evolutionary approach for finding optimal trees in undirected networks
• Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
• A survey on Benders decomposition applied to fixed-charge network design problems
• A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
• A deterministic annealing algorithm for the minimum concave cost network flow problem
• Graph simplification for infrastructure network design
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
• COLE: a new heuristic approach for fixed charge problem computational results
• A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
• An adaptive tabu-simulated annealing for concave cost transportation problems
• Heuristic solutions for general concave minimum cost network flow problems
• Analysis of a flow problem with fixed charges
• Approximate solutions of capacitated fixed-charge minimum cost network flow problems
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem
• Algorithms – ESA 2005

This page was built for publication: Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure