Exact algorithms for the product configuration problem
From MaRDI portal
Publication:6080625
DOI10.1111/itor.13172OpenAlexW4285092334MaRDI QIDQ6080625
Thiago F. Noronha, Lucas MacIel, Eduardo Theodoro Bogue
Publication date: 4 October 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13172
Cites Work
- Unnamed Item
- An approach for efficient ship routing
- Solving diameter-constrained minimum spanning tree problems by constraint programming
- A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
- Heuristic and exact algorithms for product configuration in software product lines
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- An AND/OR-graph approach to the container loading problem
- Software Product Line Engineering
- An exact algorithm for the maximum quasi‐clique problem
This page was built for publication: Exact algorithms for the product configuration problem