Dynamic node packing (Q2097666)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Dynamic node packing	scientific article

Statements

scholarly article

0 references

Dynamic node packing (English)

0 references

Christopher Muir

0 references

Alejandro Toriello

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

14 November 2022

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10107-021-01624-3

0 references

Maximizing a class of submodular utility functions

0 references

0 references

Finding a maximal weighted independent set in wireless networks

0 references

Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems

0 references

Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes

0 references

Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes

0 references

0 references

New facets for the set packing polytope

0 references

Wheel inequalities for stable set polytopes

0 references

A Characterization of Waiting Time Performance Realizable by Single-Server Queues

0 references

The Linear Programming Approach to Approximate Dynamic Programming

0 references

0 references

Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity

0 references

A Renewal Decision Problem

0 references

Advice complexity of maximum independent set in sparse and bipartite graphs

0 references

The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set

0 references

Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods

0 references

Geometric algorithms and combinatorial optimization.

0 references

Online independent sets.

0 references

Clique is hard to approximate within \(n^{1-\epsilon}\)

0 references

The asymptotic behaviour of Lovasz' \(\vartheta\) function for random graphs

0 references

Reducibility among Combinatorial Problems

0 references

Fixed interval scheduling: models, applications, computational complexity and algorithms

0 references

On Circulant Matrices

0 references

On the Shannon capacity of a graph

0 references

Speeding up branch and bound algorithms for solving the maximum clique problem

0 references

An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation

0 references

On maximal independent sets of vertices in claw-free graphs

0 references

Properties of vertex packing and independence system polyhedra

0 references

Vertex packings: Structural properties and algorithms

0 references

On the facial structure of set packing polyhedra

0 references

The maximum clique problem

0 references

A review of dynamic vehicle routing problems

0 references

Stochastic Scheduling with Release Dates and Due Dates

0 references

Exact algorithms for maximum clique: a computational study

0 references

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

0 references

A Dynamic Traveling Salesman Problem with Stochastic Arc Costs

0 references

A polyhedral approach to online bipartite matching

0 references

A class of facet producing graphs for vertex packing polyhedra

0 references

0 references

The relation of time indexed formulations of single machine scheduling problems to the node packing problem

0 references

A review on algorithms for maximum clique problems

0 references

Routing trains through a railway station based on a node packing model

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10107-021-01624-3

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2097666

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2097666&oldid=37457367"