Pages that link to "Item:Q6068536"

From MaRDI portal

← Complexity of inventory routing problems when routing is easy (Q6068536)

Jump to:navigation, search

The following pages link to Complexity of inventory routing problems when routing is easy (Q6068536):

Displaying 3 items.

A 12/7-approximation algorithm for the discrete bamboo garden trimming problem (Q2060339) (← links)
Approximation algorithms for replenishment problems with fixed turnover times (Q5918783) (← links)
Perpetual maintenance of machines with different urgency requirements (Q6078292) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere"