Pages that link to "Item:Q1867103"

From MaRDI portal

← An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note (Q1867103)

Jump to:navigation, search

The following pages link to An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note (Q1867103):

Displayed 2 items.

Multi-product lot-sizing and sequencing on a single imperfect machine (Q409261) ‎ (← links)
Lot-Sizing and Sequencing on a Single Imperfect Machine (Q3627683) ‎ (← links)

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