Dynamic multi-period vehicle routing with touting von Keskin, Merve, Branke, Juergen, Deineko, Vladimir, Strauss, Arne K.

Volltext

The bipartite travelling salesman problem: A pyramidally solvable case von Deineko, Vladimir G., Klinz, Bettina, Woeginger, Gerhard J.

Volltext

The multi-stripe travelling salesman problem von Çela, Eranda, Deineko, Vladimir G., Woeginger, Gerhard J.

Volltext

Two hardness results for core stability in hedonic coalition formation games von Deineko, Vladimir G., Woeginger, Gerhard J.

Volltext

The x-and-y-axes travelling salesman problem von Çela, Eranda, Deineko, Vladimir, Woeginger, Gerhard J.

Volltext

Uniqueness in quadratic and hyperbolic 0–1 programming problems von Deineko, Vladimir G., Klinz, Bettina, Woeginger, Gerhard J.

Volltext

Another well-solvable case of the QAP: Maximizing the job completion time variance von Çela, Eranda, Deineko, Vladimir G., Woeginger, Gerhard J.

Volltext

Unbounded knapsack problems with arithmetic weight sequences von Deineko, Vladimir G., Woeginger, Gerhard J.

Volltext

A new family of scientific impact measures: The generalized Kosmulski-indices von Deineko, Vladimir G., Woeginger, Gerhard J.

Volltext

Two hardness results for Gamson's game von Deineko, Vladimir G., Woeginger, Gerhard J.

Volltext

Complexity and in-approximability of a selection problem in robust optimization von Deineko, Vladimir G., Woeginger, Gerhard J.

Volltext

On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices von Deĭneko, Vladimir G., Shabtay, Dvir, Steiner, George

Volltext

Travelling salesman paths on Demidenko matrices von Çela, Eranda, Deineko, Vladimir G., Woeginger, Gerhard J.

Volltext

A well-solvable special case of the bounded knapsack problem von Deineko, Vladimir G., Woeginger, Gerhard J.

Volltext

Recognising permuted Demidenko matrices von Çela, Eranda, Deineko, Vladimir, Woeginger, Gerhard J.

Volltext

Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey von Burkard, Rainer E., Deῐneko, Vladimir G., van Dal, René, Jack A. A. van der Veen, Woeginger, Gerhard J.

Volltext

New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices von Çela, Eranda, Deineko, Vladimir, Woeginger, Gerhard J.

Volltext

Pinpointing the complexity of the interval min–max regret knapsack problem von Deineko, Vladimir G., Woeginger, Gerhard J.

Volltext

On the dimension of simple monotonic games von Deı̆neko, Vladimir G., Woeginger, Gerhard J.

Volltext

The complexity of computing the Muirhead–Dalton distance von Deineko, Vladimir G., Klinz, Bettina, Woeginger, Gerhard J.

Volltext