Bin covering with delivery and solving it with evolution of algorithms

zbMATH Open1289.68130MaRDI QIDQ2859441FDOQ2859441

Authors: Attila Benko, György Dósa 

Publication date: 7 November 2013

Published in: Alkalmazott Matematikai Lapok. A Magyar Tudomanyos Akademia. Matematikai es Fizikai Tudomanyok Osztalyanak Közlemenyei (Search for Journal in Brave)

Recommendations

• Better approximation algorithms for bin covering
• A min-cost bin covering problem and its algorithm
• A simulated evolution-based solution of the cover problem
• Bin covering with a general profit function: approximability results
• Online bin covering: expectations vs. guarantees

zbMATH Keywords

evolution of algorithmsneighborhood structure among the algorithms

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Online algorithms; streaming algorithms (68W27) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (1)

• The bin covering with delivery problem, extended investigations for the online case

This page was built for publication: Bin covering with delivery and solving it with evolution of algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2859441)