Pages that link to "Item:Q5943665"
From MaRDI portal
The following pages link to Efficient algorithms for integer programs with two variables per constraint. (Q5943665):
Displaying 15 items.
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- A set partitioning reformulation of a school bus scheduling problem (Q657252) (← links)
- Trichotomy for integer linear systems based on their sign patterns (Q906434) (← links)
- The vehicle routing problem with coupled time windows (Q926344) (← links)
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- Combining Traditional Map Labeling with Boundary Labeling (Q3075509) (← links)
- (Q4537737) (← links)
- (Q4938772) (← links)
- Crossing Layout in Non-planar Graph Drawings (Q5001663) (← links)
- Algorithms and Computation (Q5191657) (← links)
- Trichotomy for the reconfiguration problem of integer linear systems (Q5896129) (← links)
- Graph realization of distance sets (Q6633568) (← links)
