Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems

DOI10.1007/s10898-017-0498-9zbMath1377.90093OpenAlexW2587353993MaRDI QIDQ2399489

Thomas C. Sharkey, Hongtan Sun

Publication date: 24 August 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-017-0498-9

zbMATH Keywords

approximation algorithmcomplexity analysisintegrated network design and schedulingfractional optimization

Mathematics Subject Classification ID

Fractional programming (90C32) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

The stochastic pseudo-star degree centrality problem

Uses Software

• WinGULF

Cites Work

• Unnamed Item
• Unnamed Item
• Incremental network design with shortest paths
• Incremental network design with maximum flows
• A review of recent advances in global optimization
• Global optimization for a class of fractional programming problems
• Global optimization of fractional programs
• Linear-fractional programming. Theory, methods, applications and software.
• Fractional 0-1 programming: applications and algorithms
• A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
• Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
• A branch and bound algorithm to globally solve the sum of several linear ratios
• Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
• Scheduling

This page was built for publication: Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems