The following pages link to S. Polyakovskiy (Q262241):
Displaying 16 items.
- The focus of attention problem (Q262243) (← links)
- (Q322432) (redirect page) (← links)
- Solving hard control problems in voting systems via integer programming (Q322433) (← links)
- The three-dimensional matching problem in kalmanson matrices (Q358634) (← links)
- The approximability of three-dimensional assignment problems with bottleneck objective (Q845547) (← links)
- (Q1011219) (redirect page) (← links)
- An agent-based approach to the two-dimensional guillotine bin packing problem (Q1011220) (← links)
- The packing while traveling problem (Q1751654) (← links)
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates (Q1754152) (← links)
- Between a rock and a hard place: the two-to-one assignment problem (Q1935948) (← links)
- A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem (Q2077966) (← links)
- A multi-agent system for the weighted earliness tardiness parallel machine problem (Q2257353) (← links)
- Between a Rock and a Hard Place: The Two-to-One Assignment Problem (Q3558923) (← links)
- Minimizing Weighted Earliness and Tardiness on Parallel Machines Using a Multi-Agent System (Q5171823) (← links)
- (Q5417626) (← links)
- Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems (Q5741477) (← links)
