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