Dynamic node packing

DOI10.1007/S10107-021-01624-3MaRDI QIDQ2097666zbMATH OpenOpenAlexFDO

Authors Christopher Muir, Alejandro Toriello

Publication date 14 November 2022

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-021-01624-3

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10) Markov and semi-Markov decision processes (90C40)

Recommendations

• Adaptivity and approximation for stochastic packing problems
• scientific article; zbMATH DE number 3943557
• Facets for node packing
• Node-Packing Problems with Integer Rounding Properties
• A class of web-based facets for the generalized vertex packing problem

Cites work

• scientific article; zbMATH DE number 1302177 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1867238 (Why is no real title available?)
• A Characterization of Waiting Time Performance Realizable by Single-Server Queues
• A Renewal Decision Problem
• A class of facet producing graphs for vertex packing polyhedra
• A dynamic traveling salesman problem with stochastic arc costs
• A polyhedral approach to online bipartite matching
• A review of dynamic vehicle routing problems
• A review on algorithms for maximum clique problems
• Adaptivity and approximation for stochastic packing problems
• Advice complexity for a class of online problems
• Advice complexity of maximum independent set in sparse and bipartite graphs
• An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
• Approximating the stochastic Knapsack problem: the benefit of adaptivity
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
• Exact algorithms for maximum clique: a computational study
• Finding a maximal weighted independent set in wireless networks
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Geometric algorithms and combinatorial optimization.
• Maximizing a class of submodular utility functions
• New facets for the set packing polytope
• On circulant matrices
• On maximal independent sets of vertices in claw-free graphs
• On the Shannon capacity of a graph
• On the facial structure of set packing polyhedra
• Online independent set beyond the worst-case: secretaries, prophets, and periods
• Online independent sets.
• Properties of vertex packing and independence system polyhedra
• Reducibility among combinatorial problems
• Relaxation analysis for the dynamic knapsack problem with stochastic item sizes
• Routing trains through a railway station based on a node packing model
• Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
• Speeding up branch and bound algorithms for solving the maximum clique problem
• Stochastic Scheduling with Release Dates and Due Dates
• The Linear Programming Approach to Approximate Dynamic Programming
• The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set
• The asymptotic behaviour of Lovasz' \(\vartheta\) function for random graphs
• The maximum clique problem
• The probabilistic method
• The relation of time indexed formulations of single machine scheduling problems to the node packing problem
• Vertex packings: Structural properties and algorithms
• Wheel inequalities for stable set polytopes

Cited in

(1)

• Special issue: Global solution of integer, stochastic and nonconvex optimization problems

This page was built for publication: Dynamic node packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097666)