📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Pinpointing the complexity of the interval min-max regret knapsack problem (2010)

First Author: Deineko V

Attributed to: Special Structures in Vehicle Routing Problems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1016/j.disopt.2010.03.008

Publication URI: http://dx.doi.org/10.1016/j.disopt.2010.03.008

Type: Journal Article/Review

Parent Publication: Discrete Optimization

Issue: 4