Pages that link to "Item:Q1321662"
From MaRDI portal
The following pages link to Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662):
Displaying 44 items.
- Vertex cover meets scheduling (Q270025) (← links)
- Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- Approximating integer programs with positive right-hand sides (Q656570) (← links)
- A set partitioning reformulation of a school bus scheduling problem (Q657252) (← links)
- On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
- Bimonotone linear inequalities and sublattices of \(\mathbb R^n\) (Q817640) (← links)
- Trichotomy for integer linear systems based on their sign patterns (Q906434) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- Integer programming with 2-variable equations and 1-variable inequalities (Q987826) (← links)
- Complexity results for some global optimization problems (Q1024247) (← links)
- A bounded approximation for the minimum cost 2-sat problem (Q1193517) (← links)
- Integer programming as a framework for optimization and approximability (Q1276163) (← links)
- On approximation algorithms for the minimum satisfiability problem (Q1351157) (← links)
- Binary integer programs with two variables per inequality (Q1363421) (← links)
- Rational and integral \(k\)-regular matrices. (Q1420582) (← links)
- Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
- Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights (Q1575713) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- Complexity and approximations for submodular minimization problems on two variables per inequality constraints (Q1801066) (← links)
- Some results on the strength of relaxations of multilinear functions (Q1925788) (← links)
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine (Q1970412) (← links)
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
- Minimal distance of propositional models (Q2322705) (← links)
- Resolution of indecomposable integral flows on signed graphs (Q2400559) (← links)
- On the tree augmentation problem (Q2659770) (← links)
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs. (Q2744651) (← links)
- The Linear Complementarity Problems with a Few Variables per Constraint (Q3465945) (← links)
- (Q4537737) (← links)
- (Q4602398) (← links)
- (Q4938772) (← links)
- (Q5111750) (← links)
- Technical Note—Assortment Optimization with Small Consideration Sets (Q5129194) (← links)
- Algorithms and Computation (Q5191657) (← links)
- A q-queens problem. VI. The bishops' period (Q5225057) (← links)
- Introduction to the Maximum Solution Problem (Q5504706) (← links)
- The Next Whisky Bar (Q5740176) (← links)
- Trichotomy for the reconfiguration problem of integer linear systems (Q5896129) (← links)
- Efficient algorithms for integer programs with two variables per constraint. (Q5943665) (← links)
- Minimum shared‐power edge cut (Q6066053) (← links)
- Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints (Q6606248) (← links)
