STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES
From MaRDI portal
Publication:5055035
DOI10.17654/0974165822052OpenAlexW4309271271MaRDI QIDQ5055035
José-Luis Martínez-Flores, Diana Sanchez Partida, Enrique Gabriel Baquela, Laura Michele Báez Villegas
Publication date: 12 December 2022
Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.17654/0974165822052
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Unnamed Item
- Greedy random adaptive memory programming search for the capacitated clustering problem
- Solving capacitated clustering problems
- An effective VNS for the capacitated \(p\)-median problem
- A bionomic approach to the capacitated \(p\)-median problem
- A column generation approach to capacitated \(p\)-median problems
- Heuristic search to the capacitated clustering 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
- A scatter search heuristic for the capacitated clustering problem
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- The capacitated centred clustering problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- A new method for solving capacitated location problems based on a set partitioning approach
This page was built for publication: STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES
