The following pages link to Sergei Chubanov (Q715066):
Displaying 12 items.
- A strongly polynomial algorithm for linear systems having a binary solution (Q715067) (← links)
- A polynomial projection algorithm for linear feasibility problems (Q747780) (← links)
- Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities (Q1040690) (← links)
- An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand (Q1939682) (← links)
- A scaling algorithm for optimizing arbitrary functions over vertices of polytopes (Q2235141) (← links)
- A polynomial algorithm for convex quadratic optimization subject to linear inequalities (Q2297665) (← links)
- A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure (Q2492672) (← links)
- A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (Q2802141) (← links)
- A Greedy Algorithm for Capacitated Lot-Sizing Problems (Q4430673) (← links)
- Method of Alternating Contractions and Its Applications to Some Convex Optimization Problems (Q5010045) (← links)
- A Generalized Simplex Method for Integer Problems Given by Verification Oracles (Q5853568) (← links)
