arXiv (All)
open access
Sequence Variables: A Constraint Programming Computational Domain for Routing and Sequencing
Constraint Programming (CP) offers an intuitive, declarative framework for modeling Vehicle Routing Problems (VRP). While classical successor-based CP models can be adapted to handle optional visits or insertion-based heuristics, sequence variables provide a significantly more natural and elegant fo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Learning Constraints-Based Adaptive Hypergraph Neural Networks for Solving Vehicle Routing Problems#925753
- Tensor language model enables generative scheduling for efficient tensor compilation.#209418
- Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective#180503
- Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective#179641
- Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective#179246
Record · ID 1131418
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive