This paper considers a minimum-cost network flow problem in a bipartite graph with a single sink. The transportation costs exhibit a staircase cost structure because such types of transportation cost ...

We introduce a novel approach to solving dynamic programming problems, such as those in many economic models, on a quantum annealer, a specialized device that performs combinatorial optimization ...

Thinking about getting good at competitive programming, especially on a platform like CodeChef? It can seem like ...

Aristide Mingozzi, Lucio Bianco, Salvatore Ricciardelli, Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints, Operations Research, Vol. 45, No ...

Create divide and conquer, dynamic programming, and greedy algorithms. Understand intractable problems, P vs NP and the use of integer programming solvers to tackle some of these problems.