scientific article; zbMATH DE number 1302174

zbMATH Open0934.90065MaRDI QIDQ4247441FDOQ4247441

Authors: Tomasz Radzik 

Publication date: 16 June 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

computational complexityNewton methodfractional combinatorial optimizationMegiddo's parametric search method

Mathematics Subject Classification ID

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

Cited In (25)

• Complexity of source-sink monotone 2-parameter min cut
• A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
• Solution of a fractional combinatorial optimization problem by mixed integer programming
• Parameterized searching with mismatches for run-length encoded strings
• Optimal selection of forest patches using integer and fractional programming
• Min-max controllable risk problems
• Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
• 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
• Expanding maximum capacity path under weighted sum-type distances
• A strongly polynomial algorithm for line search in submodular polyhedra
• Approximation algorithms for combinatorial fractional programming problems
• Assortment optimization under the multinomial logit model with product synergies
• Optimization with additional variables and constraints
• The multiroute maximum flow problem revisited
• Fractional 0-1 programming and submodularity
• On maximum ratio clique relaxations
• The maximum ratio clique problem
• Approximation algorithms for fractional knapsack problems
• Exact solution approaches for a class of bilevel fractional programs
• Column generation extensions of set covering greedy heuristics
• Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
• Optimization on fractal sets
• Computing and minimizing the relative regret in combinatorial optimization with interval data
• Mathematical optimization ideas for biodiversity conservation

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)