Pages that link to "Item:Q1847196"

From MaRDI portal

← An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (Q1847196)

Jump to:navigation, search

The following pages link to An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (Q1847196):

Displaying 1 item.

Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem (Q2566944) (← links)

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