Pages that link to "Item:Q1631662"

From MaRDI portal

← On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications (Q1631662)

Jump to:navigation, search

The following pages link to On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications (Q1631662):

Displaying 2 items.

A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)

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