Pages that link to "Item:Q3910301"

The following pages link to Polynomial algorithms in linear programming (Q3910301):

Displaying 50 items.

• A tool for deciding the satisfiability of continuous-time metric temporal logic (Q262137) (← links)
• On integer programming with bounded determinants (Q315478) (← links)
• The width and integer optimization on simplices with bounded minors of the constraint matrices (Q315480) (← links)
• An approach to characterize graded entailment of arguments through a label-based framework (Q511660) (← links)
• Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
• Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm (Q723482) (← links)
• Two design principles of geometric algorithms in finite-precision arithmetic (Q749243) (← links)
• Computational complexity of norm-maximization (Q757258) (← links)
• Robust vertex enumeration for convex hulls in high dimensions (Q827269) (← links)
• Recognizing one-dimensional Euclidean preference profiles (Q845009) (← links)
• The \(p\)-hub center allocation problem (Q852943) (← links)
• Unique sink orientations of grids (Q930596) (← links)
• Integer program with bimodular matrix (Q1015329) (← links)
• Objective functions and the complexity of policy design (Q1097156) (← links)
• A relaxed version of Karmarkar's method (Q1108926) (← links)
• A polynomial-time algorithm, based on Newton's method, for linear programming (Q1108927) (← links)
• The diagonalizability of quadratic functions and the arbitrariness of shadow prices (Q1181978) (← links)
• A natural randomization strategy for multicommodity flow and related algorithms (Q1198070) (← links)
• Projection algorithms for linear programming (Q1199509) (← links)
• Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method (Q1293951) (← links)
• Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
• On the recognition of \(S\)-systems (Q1311323) (← links)
• The ellipsoid algorithm using parallel cuts (Q1315450) (← links)
• \(k\)-violation linear programming (Q1336744) (← links)
• Minimum cost multiflows in undirected networks (Q1337137) (← links)
• Interactive decision making: Equivalence of modified formulations (Q1339226) (← links)
• Multiflows and disjoint paths of minimum total cost (Q1373749) (← links)
• The mixed evacuation problem (Q1631682) (← links)
• Simulating cardinal preferences in Boolean games: a proof technique (Q1641024) (← links)
• An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277) (← links)
• The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (Q1662648) (← links)
• Bin packing under linear constraints (Q1679514) (← links)
• A convex programming-based algorithm for mean payoff stochastic games with perfect information (Q1686541) (← links)
• An extension of Chubanov's algorithm to symmetric cones (Q1717223) (← links)
• FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
• A utility theory based interactive approach to robustness in linear optimization (Q1753136) (← links)
• Optimization with additional variables and constraints (Q1779712) (← links)
• Reasoning within fuzzy OWL 2 EL revisited (Q1795363) (← links)
• Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
• A subexponential bound for linear programming (Q1923862) (← links)
• Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
• Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
• Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games (Q2070558) (← links)
• Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
• Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration (Q2149567) (← links)
• Fuzzy linear programming problems: models and solutions (Q2153702) (← links)
• On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
• Optimal multi-unit mechanisms with private demands (Q2173417) (← links)
• Shortest paths and convex hulls in 2D complexes with non-positive curvature (Q2206723) (← links)
• The problem of identifying the model of substitution of production factors (Q2207528) (← links)