Home ›
Entities
› academia
› Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
Research article (European Journal of Operational Research, 2021) · cited 11× · AI/ML
Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
Summary
Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks is a scholarly article[1].
Key Facts
Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Retrieved May 24, 2026, from https://4ort.xyz/entity/valid-inequalities-and-branch-and-cut-algorithm-for-the-pickup-and-delivery-traveling-salesman-problem-with-multiple-sta
MLA“Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/valid-inequalities-and-branch-and-cut-algorithm-for-the-pickup-and-delivery-traveling-salesman-problem-with-multiple-sta.
BibTeX@misc{4ortxyz_valid-inequalities-and-branch-and-cut-algorithm-for-the-pickup-and-delivery-traveling-salesman-problem-with-multiple-sta_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks}}, year = {2026}, url = {https://4ort.xyz/entity/valid-inequalities-and-branch-and-cut-algorithm-for-the-pickup-and-delivery-traveling-salesman-problem-with-multiple-sta}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks — https://4ort.xyz/entity/valid-inequalities-and-branch-and-cut-algorithm-for-the-pickup-and-delivery-traveling-salesman-problem-with-multiple-sta (retrieved 2026-05-24)
