Sequential algorithm for the solution of problems of combinatorial optimization on permutations
From MaRDI portal
Publication:3755239
DOI10.1007/BF01069422zbMATH Open0618.90079MaRDI QIDQ3755239FDOQ3755239
Authors: A. N. Khodzinskij 
Publication date: 1985
Published in: Cybernetics (Search for Journal in Brave)
Recommendations
heuristic algorithmstraveling salesmanquadratic assignmentlinear assignmentoptimization on permutations
Cites Work
Cited In (19)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edge histogram based sampling with local search for solving permutation problems
- A monotone iterative method for solving the combinatorial game-type optimization problems on permutations
- Title not available (Why is that?)
- An Algorithm for the Quadratic Assignment Problem
- A recurrent algorithm for solving a combinatorial problem of arrangement with restrictions
- Title not available (Why is that?)
- On the sequential ordering problems
- Title not available (Why is that?)
- An algebraic approach for the search space of permutations with repetition
- On the method of interchanging networks for permutation problems
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a pattern sequencing problem to minimize the maximum number of open stacks
- Subclasses of solvable problems from classes of combinatorial optimization problems
- Title not available (Why is that?)
This page was built for publication: Sequential algorithm for the solution of problems of combinatorial optimization on permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755239)
