Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems
DOI10.1007/S10898-017-0498-9zbMATH Open1377.90093OpenAlexW2587353993MaRDI QIDQ2399489FDOQ2399489
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
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
approximation algorithmcomplexity analysisintegrated network design and schedulingfractional optimization
Fractional programming (90C32) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Scheduling. Theory, algorithms, and systems.
- A review of recent advances in global optimization
- Global optimization of fractional programs
- Global optimization for a class of fractional programming problems
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
- 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.
- A branch and bound algorithm to globally solve the sum of several linear ratios
- Incremental network design with maximum flows
- Fractional 0-1 programming: applications and algorithms
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
Cited In (1)
Uses Software
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)
