Pages that link to "Item:Q3783056"

The following pages link to Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh (Q3783056):

Displaying 17 items.

• On finding representative non-dominated points for bi-objective integer network flow problems (Q337035) (← links)
• A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem (Q833641) (← links)
• Multiple objective minimum cost flow problems: a review (Q853016) (← links)
• Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
• \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows (Q909586) (← links)
• A two-phase algorithm for the biobjective integer minimum cost flow problem (Q1000988) (← links)
• Finding non-dominated solutions in bi-objective integer network flow problems (Q1010260) (← links)
• On the computation of all supported efficient solutions in multi-objective integer network flow problems (Q1042100) (← links)
• On the efficient point set of tricriteria linear programs (Q1319580) (← links)
• The multiscenario lot size problem with concave costs. (Q1426700) (← links)
• Approximation of convex curves with application to the bicriterial minimum cost flow problem (Q1825606) (← links)
• An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
• An approximation algorithm for a general class of parametric optimization problems (Q2156299) (← links)
• Multiobjective transportation network design and routing problems: Taxonomy and annotation (Q2368289) (← links)
• A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems (Q5326806) (← links)
• Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint (Q6097849) (← links)
• Parametric matroid interdiction (Q6122085) (← links)