Solving cyclic antibandwidth problem by SAT
From MaRDI portal
Cites work
- A general variable neighborhood search for the cyclic antibandwidth problem
- A New Look at BDDs for Pseudo-Boolean Constraints
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- Cardinality Networks and Their Applications
- Cardinality networks: a theoretical and empirical study
- Duplex encoding of staircase at-most-one constraints for the antibandwidth problem
- Future paths for integer programming and links to artificial intelligence
- General variable neighborhood search for the continuous optimization
- GRASP with path relinking heuristics for the antibandwidth problem
- On explicit formulas for bandwidth and antibandwidth of hypercubes
- On Some Variants of the Bandwidth Minimization Problem
- On the separation number of a graph
- SAT-boosted tabu search for coloring massive graphs
- The Cyclic Antibandwidth Problem
- The use of ranks to avoid the assumption of normality implicit in the analysis of variance.
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Variable neighborhood search
- Variable neighborhood search: basics and variants
This page was built for publication: Solving cyclic antibandwidth problem by SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7444042)