Pages that link to "Item:Q4327416"

The following pages link to Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality (Q4327416):

Displaying 40 items.

• Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
• The two variable per inequality abstract domain (Q656848) (← links)
• A set partitioning reformulation of a school bus scheduling problem (Q657252) (← links)
• Tractability conditions for numeric CSPs (Q683751) (← links)
• A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations (Q709101) (← links)
• Bimonotone linear inequalities and sublattices of \(\mathbb R^n\) (Q817640) (← links)
• Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
• Cyclic games and linear programming (Q944703) (← links)
• Finding a bounded mixed-integer solution to a system of dual network inequalities (Q957371) (← links)
• Approximability of clausal constraints (Q970111) (← links)
• Relaxation-based algorithms for minimax optimization problems with resource allocation applications (Q1332312) (← links)
• On approximation algorithms for the minimum satisfiability problem (Q1351157) (← links)
• Local and global relational consistency (Q1391940) (← links)
• Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
• Querying temporal and spatial constraint networks in PTIME (Q1589478) (← links)
• Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
• An efficient algorithm for a class of constraint satisfaction problems (Q1611994) (← links)
• A certifying algorithm for lattice point feasibility in a system of UTVPI constraints (Q1702822) (← links)
• Incremental closure for systems of two variables per inequality (Q1733055) (← links)
• Complexity and approximations for submodular minimization problems on two variables per inequality constraints (Q1801066) (← links)
• Improved algorithms for optimal length resolution refutation in difference constraint systems (Q1941901) (← links)
• Relaxing the strong triadic closure problem for edge strength inference (Q1987174) (← links)
• On integer closure in a system of unit two variable per inequality constraints (Q2023870) (← links)
• A linear programming primer: from Fourier to Karmarkar (Q2177789) (← links)
• Analyzing fractional Horn constraint systems (Q2205946) (← links)
• Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
• Inverse generalized minimum cost flow problem under the Hamming distances (Q2314066) (← links)
• On a generalization of Horn constraint systems (Q2399383) (← links)
• Parameterized complexity of sparse linear complementarity problems (Q2408196) (← links)
• A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363) (← links)
• On a decision procedure for quantified linear programs (Q2462634) (← links)
• A polynomial time algorithm for Zero-Clairvoyant scheduling (Q2475435) (← links)
• Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← links)
• A new?old algorithm for minimum-cut and maximum-flow in closure graphs (Q2744651) (← links)
• Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
• A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints (Q2819515) (← links)
• A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time (Q3064043) (← links)
• Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
• Minimum shared‐power edge cut (Q6066053) (← links)
• Applications and efficient algorithms for integer programming problems on monotone constraints (Q6087067) (← links)