The following pages link to (Q4247441):
Displaying 23 items.
- Parameterized searching with mismatches for run-length encoded strings (Q714802) (← links)
- Optimal selection of forest patches using integer and fractional programming (Q968037) (← links)
- Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
- Optimization with additional variables and constraints (Q1779712) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- Approximation algorithms for fractional knapsack problems (Q1866996) (← links)
- Min-max controllable risk problems (Q2040608) (← links)
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks (Q2064296) (← links)
- Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
- Expanding maximum capacity path under weighted sum-type distances (Q2144881) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- Assortment optimization under the multinomial logit model with product synergies (Q2294378) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- Mathematical optimization ideas for biodiversity conservation (Q2356177) (← links)
- A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694) (← links)
- Complexity of source-sink monotone 2-parameter min cut (Q2670479) (← links)
- Exact solution approaches for a class of bilevel fractional programs (Q2679008) (← links)
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- Solution of a fractional combinatorial optimization problem by mixed integer programming (Q3411295) (← links)
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection (Q4995087) (← links)
- The multiroute maximum flow problem revisited (Q5469126) (← links)
- On maximum ratio clique relaxations (Q6085884) (← links)
