Algorithms for network piecewise-linear programs: A comparative study

DOI10.1016/S0377-2217(96)00109-9zbMath0920.90139OpenAlexW2053157490MaRDI QIDQ1278601

Clovis Perin, Arlene F. Machado, Fernando Augusto S. Marins, Edson Luiz França Senne, Kenneth Darby-Dowman

Publication date: 27 April 1999

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00109-9

zbMATH Keywords

experimental designpiecewise-linear programmingconvex separable piecewise-linear objective functionnetwork piecewise-linear programming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Uses Software

• SAS
• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• A practical anti-degeneracy row selection technique in network linear programming
• Finding Minimum-Cost Circulations by Successive Approximation
• Network design and dynamic routing under queueing demand
• Relationships among linear formulations of separable convex piecewise linear programs
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Dual Algorithms for Pure Network Problems
• Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• A network simplex method
• Stochastic transportation problems and other newtork related convex problems
• Solving the Pipe Network Analysis Problem Using Optimization Techniques
• The alternating basis algorithm for assignment problems
• Reporting computational experiments in mathematical programming
• Network Reoptimization Algorithms: A Statistically Designed Comparison