Some thoughts on combinatorial optimisation
From MaRDI portal
Recommendations
Cites work
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A Selection Problem of Shared Fixed Costs and Network Flows
- An Algorithm for Large Zero-One Knapsack Problems
- An introduction to parallelism in combinatorial optimization
- Computing Partitions with Applications to the Knapsack Problem
- Experiments in quadratic 0-1 programming
- Geometric algorithms and combinatorial optimization
- Hard Knapsack Problems
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 3900494 (Why is no real title available?)
- scientific article; zbMATH DE number 3904331 (Why is no real title available?)
- scientific article; zbMATH DE number 3943559 (Why is no real title available?)
- scientific article; zbMATH DE number 4027150 (Why is no real title available?)
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- scientific article; zbMATH DE number 192876 (Why is no real title available?)
- scientific article; zbMATH DE number 3534294 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 795223 (Why is no real title available?)
- scientific article; zbMATH DE number 956787 (Why is no real title available?)
- Job Shop Scheduling by Local Search
- Maximum matching and a polyhedron with 0,1-vertices
- Meaningfulness of conclusions from combinatorial optimization
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Neural networks for automated vehicle dispatching
- On the cut polytope
- Polyhedral study of the capacitated vehicle routing problem
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Solution of large-scale symmetric travelling salesman problems
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Tabu Search—Part I
- Testing optimality for quadratic 0?1 unconstrained problems
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Topological design of computer communication networks -- the overall design problem
- Topological design of telecommunication networks --- local access design methods
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
Cited in
(5)- Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- Whizzkids: Two exercises in computational discrete optimization
- Research trends in combinatorial optimization
- Fifty years of metaheuristics
This page was built for publication: Some thoughts on combinatorial optimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388818)
