STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES
From MaRDI portal
Publication:5055035
Cites work
- A bionomic approach to the capacitated \(p\)-median problem
- A column generation approach to capacitated p-median problems
- A new method for solving capacitated location problems based on a set partitioning approach
- A scatter search heuristic for the capacitated clustering problem
- An effective VNS for the capacitated \(p\)-median problem
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Greedy random adaptive memory programming search for the capacitated clustering problem
- Heuristic search to the capacitated clustering problem
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Innovations in hybrid intelligent systems. Selected papers based on the presentations at the 2nd international workshop on hybrid artificial intelligence systems, (HAIS 2007), Salamance, Spain, November 2007
- Solving capacitated clustering problems
- The capacitated centred clustering problem
This page was built for publication: STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055035)