Cross line and column generation for the cut covering problem in wireless networks

DOI10.1016/J.ENDM.2010.05.033zbMATH Open1237.90142OpenAlexW2076952987MaRDI QIDQ2883571FDOQ2883571

Authors: Christelle Caillouet, Stéphane Pérennes, Hervé Rivano 

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.033

Recommendations

• A column generation and branch-and-cut algorithm for the channel assignment problem
• An Integer Programming Approach to the Bandwidth Packing Problem
• On column generation formulations for the RWA problem
• Solving a resource allocation problem in wireless mesh networks: a comparison between a CP-based and a classical column generation
• On a class of covering problems with variable capacities in wireless networks

zbMATH Keywords

linear programmingwireless networkscolumn and line generation

Mathematics Subject Classification ID

Linear programming (90C05) Applications of mathematical programming (90C90) Case-oriented studies in operations research (90B90) Communication networks in operations research (90B18)

Cites Work

• Selected Topics in Column Generation
• The ellipsoid method and its consequences in combinatorial optimization
• Title not available (Why is that?)
• On the complexity of bandwidth allocation in radio networks

Cited In (3)

• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• Speeding up column generation for robust wireless network planning
• Solving a resource allocation problem in wireless mesh networks: a comparison between a CP-based and a classical column generation

This page was built for publication: Cross line and column generation for the cut covering problem in wireless networks

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