Alysson M. Costa
Computers & Operations Research · 2005
A researcher in the Science corpus: 1 paper; trusts 0 researchers and is trusted by 6 researchers here, as inferred from the citation graph.
Who trusts Alysson M. Costa overall
Papers from Alysson M. Costa's perspective
Ordered by how strongly the researchers Alysson M. Costa trusts endorse each paper. Same corpus, a different order for every researcher.
- Partitioning procedures for solving mixed-variables programming problems
- The generalized minimum spanning tree problem
- What you should know about the vehicle routing problem
- Traveling Salesman Problems with Profits (Transportation Science)
- The NP-Completeness Column: An Ongoing Guide
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries (European Journal of Operational Research)
- Berth allocation planning in the public berth system by genetic algorithms (European Journal of Operational Research)
- Robust discrete optimization and network flows (Mathematical programming)
- A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty
- A metaheuristic for the pickup and delivery problem with time windows (Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001)
Their papers
- A survey on benders decomposition applied to fixed-charge network design problems (2005) — 322 citations