A primal heuristic for optimizing the topology of gas networks based on dual information

DOI10.1007/S13675-014-0029-0zbMath1309.90015OpenAlexW1968970244MaRDI QIDQ2260914

Jesco Humpola, Thomas Lehmann, Armin Fügenschuh

Publication date: 12 March 2015

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-014-0029-0

zbMATH Keywords

heuristicsdualitymixed-integer nonlinear programmingrelaxationsnonlinear network design applications

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (5)

Inexact feasibility pump for mixed integer nonlinear programming ⋮ Sufficient pruning conditions for MINLP in gas network design ⋮ Convex Relaxations for Gas Expansion Planning ⋮ Convex reformulations for solving a nonlinear network design problem ⋮ Valid inequalities for the topology optimization problem in gas network design

Uses Software

• Unnamed Item
• SoPlex
• CPLEX
• Couenne
• Bonmin
• FEASPUMP
• Ipopt
• MINOTAUR

Cites Work

• A recipe for finding good solutions to MINLPs
• A framework for globally optimizing mixed-integer signomial programs
• Heuristics for convex mixed integer nonlinear programs
• SCIP: solving constraint integer programs
• Restrict-and-relax search for 0-1 mixed-integer programs
• RENS. The optimal rounding
• Minotaur: a mixed-integer nonlinear optimization toolkit
• Convex reformulations for solving a nonlinear network design problem
• An algorithmic framework for convex mixed integer nonlinear programs
• A feasibility pump for mixed integer nonlinear programs
• Feasibility pump 2.0
• Rounding-based heuristics for nonconvex MINLPS
• Exploring relaxation induced neighborhoods to improve MIP solutions
• A polyhedral branch-and-cut approach to global optimization
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• A storm of feasibility pumps for nonconvex MINLP
• Pivot and shift -- a mixed integer programming heuristic
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP
• Improving the feasibility pump
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• The feasibility pump
• Sensitivity and stability analysis for nonlinear programming
• An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
• Validation of nominations in gas network optimization: models, methods, and solutions
• Solving Real-World Linear Programs: A Decade and More of Progress
• Commentary—Progress in Linear Programming
• Rounding and Propagation Heuristics for Mixed Integer Programming
• Computational Integer Programming and Cutting Planes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A primal heuristic for optimizing the topology of gas networks based on dual information