Symmetry and Search in a Network Design Problem

DOI10.1007/11493853_25MaRDI QIDQ5450942zbMATH OpenOpenAlexFDO

Authors Barbara M. Smith

Publication date 17 March 2008

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11493853_25

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Communication networks in operations research (90B18)

Recommendations

• Boosting set constraint propagation for network design
• Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting
• A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
• Improving Discrete Model Representations via Symmetry Considerations
• Reformulation and decomposition approaches for traffic routing in optical networks

Cited in

(7)

• Cutting plane algorithms for solving a stochastic edge-partition problem
• Automatically improving constraint models in Savile Row
• \textsc{Conjure}: automatic generation of constraint models from problem specifications
• Enhancing set constraint solvers with lexicographic bounds
• Boosting set constraint propagation for network design
• Symmetry-driven network reconstruction through pseudobalanced coloring optimization
• \textsc{Athanor}: local search over abstract constraint specifications

This page was built for publication: Symmetry and Search in a Network Design Problem

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