scientific article; zbMATH DE number 1302174

MaRDI QIDQ4247441zbMATH OpenFDO

Authors Tomasz Radzik

Publication date 16 June 1999

zbMATH Keywords

computational complexityfractional combinatorial optimizationMegiddo's parametric search methodNewton method

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1256704
• Combinatorial optimization with rational objective functions
• Ratio combinatorial programs
• Approximation algorithms for combinatorial fractional programming problems
• Solution of a fractional combinatorial optimization problem by mixed integer programming

Cited in

(28)

• Computing and minimizing the relative regret in combinatorial optimization with interval data
• Optimization with additional variables and constraints
• Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
• Approximation algorithms for fractional knapsack problems
• Min-max controllable risk problems
• Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
• Column generation extensions of set covering greedy heuristics
• Expanding maximum capacity path under weighted sum-type distances
• Fractional 0-1 programming and submodularity
• Optimization on fractal sets
• Assortment optimization under the multinomial logit model with product synergies
• The maximum ratio clique problem
• Mathematical optimization ideas for biodiversity conservation
• A strongly polynomial algorithm for line search in submodular polyhedra
• Complexity of source-sink monotone 2-parameter min cut
• Exact solution approaches for a class of bilevel fractional programs
• Interdicting structured combinatorial optimization problems with {0,1}-objectives
• Sparsest-cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
• Solution of a fractional combinatorial optimization problem by mixed integer programming
• scientific article; zbMATH DE number 1256704 (Why is no real title available?)
• Approximation algorithms for combinatorial fractional programming problems
• A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
• The multiroute maximum flow problem revisited
• On maximum ratio clique relaxations
• A survey of exact and approximation algorithms for linear-parametric optimization problems
• The inverse optimal value problem for linear fractional programming
• Parameterized searching with mismatches for run-length encoded strings
• Optimal selection of forest patches using integer and fractional programming

This page was built for publication:

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