Pages that link to "Item:Q4327416"
From MaRDI portal
The following pages link to Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality (Q4327416):
Displayed 23 items.
- The two variable per inequality abstract domain (Q656848) (← links)
- A set partitioning reformulation of a school bus scheduling problem (Q657252) (← 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)
- Improved algorithms for optimal length resolution refutation in difference constraint systems (Q1941901) (← links)
- On a decision procedure for quantified linear programs (Q2462634) (← links)
- A polynomial time algorithm for Zero-Clairvoyant scheduling (Q2475435) (← links)
- A new?old algorithm for minimum-cut and maximum-flow in closure graphs (Q2744651) (← links)
- A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time (Q3064043) (← links)
- On memoryless provers and insincere verifiers (Q3639202) (← links)
- Introduction to the Maximum Solution Problem (Q5504706) (← links)
- A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901710) (← links)