Dynamic node packing
type: Item
instance of: scholarly article
title: Dynamic node packing
zbMATH Open document ID: 1506.90229
author: Christopher Muir
author: Alejandro Toriello
published in: Mathematical Programming. Series A. Series B
publication date: 2022-11-14T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7616326
MaRDI profile type: Publication
full work available at URL: s10107-021-01624-3
OpenAlex ID: W3131677305
cites work: Maximizing a class of submodular utility functions
cites work: The probabilistic method
cites work: Finding a maximal weighted independent set in wireless networks
cites work: Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
cites work: Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
cites work: Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes
cites work: Q2954988
cites work: New facets for the set packing polytope
cites work: Wheel inequalities for stable set polytopes
cites work: A Characterization of Waiting Time Performance Realizable by Single-Server Queues
cites work: The Linear Programming Approach to Approximate Dynamic Programming
cites work: Adaptivity and approximation for stochastic packing problems
cites work: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
cites work: A Renewal Decision Problem
cites work: Advice complexity of maximum independent set in sparse and bipartite graphs
cites work: The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set
cites work: Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
cites work: Geometric algorithms and combinatorial optimization.
cites work: Online independent sets.
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
cites work: The asymptotic behaviour of Lovasz' \(\vartheta\) function for random graphs
cites work: Reducibility among Combinatorial Problems
cites work: Fixed interval scheduling: models, applications, computational complexity and algorithms
cites work: On circulant matrices
cites work: On the Shannon capacity of a graph
cites work: Speeding up branch and bound algorithms for solving the maximum clique problem
cites work: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
cites work: On maximal independent sets of vertices in claw-free graphs
cites work: Properties of vertex packing and independence system polyhedra
cites work: Vertex packings: Structural properties and algorithms
cites work: On the facial structure of set packing polyhedra
cites work: The maximum clique problem
cites work: A review of dynamic vehicle routing problems
cites work: Stochastic Scheduling with Release Dates and Due Dates
cites work: Exact algorithms for maximum clique: a computational study
cites work: Q4315289
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Q4793326
cites work: A Dynamic Traveling Salesman Problem with Stochastic Arc Costs
cites work: A polyhedral approach to online bipartite matching
cites work: A class of facet producing graphs for vertex packing polyhedra
cites work: Q4247444
cites work: The relation of time indexed formulations of single machine scheduling problems to the node packing problem
cites work: A review on algorithms for maximum clique problems
cites work: Routing trains through a railway station based on a node packing model
DOI: 10.1007/S10107-021-01624-3
description: scientific article; zbMATH DE number 7616326