Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects

DOI10.1016/j.orl.2021.04.003OpenAlexW3157672536MaRDI QIDQ2060557

Tomasz Tkocz, Alan M. Frieze

Publication date: 13 December 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.03416

zbMATH Keywords

probabilistic analysisspanning treeassignment problemcost constraint

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Related Items (1)

Typical values of extremal-weight combinatorial structures with independent symmetric weights

Cites Work

• New approaches to multi-objective optimization
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Minimum-weight combinatorial structures under random cost-constraints
• A randomly weighted minimum spanning tree with a random cost constraint
• Integer Programming
• Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
• The constrained minimum spanning tree problem
• A Randomly Weighted Minimum Arborescence with a Random Cost Constraint
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects