A pipe routing hybrid approach based on A-star search and linear programming

DOI10.1007/978-3-030-78230-6_12OpenAlexW3171209207MaRDI QIDQ2117217FDOQ2117217

Vincent Vidal, Vincent Baudoui, Cédric Pralet, Marvin Stanczak

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-78230-6_12

zbMATH Keywords

linear programmingpipe routingweighted A*

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Weighted \(A^*\) search - unifying view and application
• Constraint Programming Approach for Spatial Packaging Problem

This page was built for publication: A pipe routing hybrid approach based on A-star search and linear programming

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