The following pages link to (Q4252434):
Displaying 8 items.
- A polynomial oracle-time algorithm for convex integer minimization (Q623465) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808) (← links)
- On circuit diameter bounds via circuit imbalances (Q2164689) (← links)
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
- Vector and matrix apportionment problems and separable convex integer optimization (Q2482690) (← links)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
- On circuit diameter bounds via circuit imbalances (Q6589764) (← links)
