scientific article; zbMATH DE number 1302174
From MaRDI portal
Publication:4247441
zbMath0934.90065MaRDI QIDQ4247441
Publication date: 16 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityNewton methodfractional combinatorial optimizationMegiddo's parametric search method
Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (23)
Expanding maximum capacity path under weighted sum-type distances ⋮ Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem ⋮ Fractional 0-1 programming and submodularity ⋮ Complexity of source-sink monotone 2-parameter min cut ⋮ Exact solution approaches for a class of bilevel fractional programs ⋮ On maximum ratio clique relaxations ⋮ A strongly polynomial algorithm for line search in submodular polyhedra ⋮ Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives ⋮ Optimal selection of forest patches using integer and fractional programming ⋮ Parameterized searching with mismatches for run-length encoded strings ⋮ Optimization with additional variables and constraints ⋮ Min-max controllable risk problems ⋮ Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem ⋮ Assortment optimization under the multinomial logit model with product synergies ⋮ The multiroute maximum flow problem revisited ⋮ Computing and minimizing the relative regret in combinatorial optimization with interval data ⋮ Network disconnection games: a game theoretic approach to checkpoint evaluation in networks ⋮ Solution of a fractional combinatorial optimization problem by mixed integer programming ⋮ A Mixed-Integer Fractional Optimization Approach to Best Subset Selection ⋮ Column generation extensions of set covering greedy heuristics ⋮ Approximation algorithms for fractional knapsack problems ⋮ The maximum ratio clique problem ⋮ Mathematical optimization ideas for biodiversity conservation
This page was built for publication:
