Pages that link to "Item:Q3712126"

The following pages link to Complexity of some parametric integer and network programming problems (Q3712126):

Displaying 39 items.

• Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
• Approximation schemes for the parametric knapsack problem (Q506160) (← links)
• Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
• An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
• Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
• Special cases of the quadratic assignment problem (Q1129914) (← links)
• An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion (Q1183333) (← links)
• Algorithms and complexity analysis for some flow problems (Q1317482) (← links)
• The inverse-parametric knapsack problem (Q1388831) (← links)
• Note on combinatorial optimization with max-linear objective functions (Q1803670) (← links)
• Some concepts of stability analysis in combinatorial optimization (Q1805456) (← 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)
• Computing the sequence of \(k\)-cardinality assignments (Q2165282) (← links)
• An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
• Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
• An FPTAS for the parametric knapsack problem (Q2361499) (← links)
• A note on the parametric maximum flow problem and some related reoptimization issues (Q2480211) (← links)
• Constructing the minimization diagram of a two-parameter problem (Q2638942) (← links)
• Parametric methods in integer linear programming (Q2639777) (← links)
• Complexity of source-sink monotone 2-parameter min cut (Q2670479) (← links)
• (Q2882852) (← links)
• A fast parametric assignment algorithm with applications in max-algebra (Q3057132) (← links)
• Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh (Q3783056) (← links)
• Parametric maximal flows in generalized networks – complexity and algorithms (Q3813580) (← links)
• Algorithms for flows with parametric capacities (Q3823390) (← links)
• The quickest flow problem (Q4031968) (← links)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
• PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS (Q4818570) (← links)
• Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts (Q5041732) (← links)
• Parametric problems on graphs of bounded tree-width (Q5056150) (← links)
• Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
• Graph Clustering in All Parameter Regimes (Q5089206) (← links)
• A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1 (Q5479833) (← links)
• A lower bound for the shortest path problem (Q5956014) (← links)
• Shadows of Newton polytopes (Q6076195) (← links)
• Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint (Q6097849) (← links)
• Parametric matroid interdiction (Q6122085) (← links)