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

DOI10.1007/S10898-017-0498-9MaRDI QIDQ2399489zbMATH OpenOpenAlexFDO

Authors Hongtan Sun, Thomas C. Sharkey

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)

Recommendations

• Approximation algorithms for combinatorial fractional programming problems
• Approximation schemes for fractional multicommodity flow problems
• An \(\varepsilon\)-approximation algorithm for a class of fractional programs
• Existence and discrete approximation for optimization problems governed by fractional differential equations
• An \(\varepsilon\)-approximation algorithm for generalized fractional programs
• Revisiting Dinkelbach-type algorithms for generalized fractional programs
• On the optimality of nonlinear fractional disjunctive programming problems
• Dinkelbach Type Approximation Algorithms for Nonlinear Fractional Optimization Problems
• Faster approximation schemes for fractional multicommodity flow problems
• Faster approximation schemes for fractional multicommodity flow problems

Cites work

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

Cited in

(1)

• The stochastic pseudo-star degree centrality problem

Describes a project that uses

Uses Software

• WinGULF

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399489)