Some thoughts on combinatorial optimisation
From MaRDI portal
Publication:1388818
DOI10.1016/0377-2217(95)00005-BzbMath0904.90137OpenAlexW1991848948WikidataQ58826527 ScholiaQ58826527MaRDI QIDQ1388818
Publication date: 19 January 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00005-b
Related Items (2)
Research trends in combinatorial optimization ⋮ Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polyhedral study of the capacitated vehicle routing problem
- Meaningfulness of conclusions from combinatorial optimization
- Solution of large-scale symmetric travelling salesman problems
- An introduction to parallelism in combinatorial optimization
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Experiments in quadratic 0-1 programming
- Topological design of telecommunication networks --- local access design methods
- Topological design of computer communication networks -- the overall design problem
- Neural networks for automated vehicle dispatching
- Geometric algorithms and combinatorial optimization
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Hard Knapsack Problems
- An Algorithm for Large Zero-One Knapsack Problems
- Tabu Search—Part I
- Computing Partitions with Applications to the Knapsack Problem
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
- On the cut polytope
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- Testing optimality for quadratic 0?1 unconstrained problems
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Maximum matching and a polyhedron with 0,1-vertices
- A Selection Problem of Shared Fixed Costs and Network Flows
- Job Shop Scheduling by Local Search
This page was built for publication: Some thoughts on combinatorial optimisation
