The interval min-max regret knapsack packing-delivery problem

Shijin Wang, Wenli Cui, Feng Chu and Jianbo Yu

Year of publication:	2021
Authors:	Wang, Shijin ; Cui, Wenli ; Chu, Feng ; Yu, Jianbo
Subject:	0-1 Knapsack problem \| Benders-like decomposition algorithm \| interval min-max regret \| simulated annealing \| travelling salesman problem \| Theorie \| Theory \| Ganzzahlige Optimierung \| Integer programming \| Rundreiseproblem \| Travelling salesman problem \| Tourenplanung \| Vehicle routing problem \| Dekompositionsverfahren \| Decomposition method \| Mathematische Optimierung \| Mathematical programming

Online Resource

Check full text access |

More access options

doi.org

www.tandfonline.com

Check Google Scholar

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10012625957

A service of the