EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"combinatorial problem"
Narrow search

Narrow search

Year of publication
Subject
All
combinatorial problem 3 Algorithm 2 Algorithmus 2 Mastermind 2 Theorie 2 Theory 2 algorithm 2 complexity 2 permutation 2 Complex systems 1 Complexity management 1 Evolutionary algorithm 1 Evolutionärer Algorithmus 1 Heuristics 1 Heuristik 1 International migration 1 Internationale Migration 1 Komplexe Systeme 1 Komplexitätsmanagement 1 Rundreiseproblem 1 TSP 1 Tourenplanung 1 Travelling salesman problem 1 Vehicle routing problem 1 genetic algorithm 1 hybrid genetic algorithm 1 pattern replacement 1 self-organisation migration algorithm 1 travelling salesman problem 1
more ... less ...
Online availability
All
Free 2 Undetermined 1
Type of publication
All
Article 3
Type of publication (narrower categories)
All
Article in journal 2 Aufsatz in Zeitschrift 2 Article 1
Language
All
English 3
Author
All
Glazik, Christian 2 Sauerland, Volkmar 2 Srivastav, Anand 2 Dinesh, Kamala Kannan 1 Ouali, Mourad El 1 Ouali, Mourad el 1 Rajakumar, R. 1 Subramanian, R. 1
more ... less ...
Published in...
All
Games 2 International journal of applied management science : IJAMS 1
Source
All
ECONIS (ZBW) 2 EconStor 1
Showing 1 - 3 of 3
Cover Image
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad El; Glazik, Christian; Sauerland, Volkmar; … - In: Games 9 (2018) 1, pp. 1-12
Mastermind is a two players zero sum game of imperfect information. Starting with Erdos and Rényi (1963), its combinatorics have been studied to date by several authors, e.g., Knuth (1977), Chvátal (1983), Goodrich (2009). The first player, called 'codemaker', chooses a secret code and the...
Persistent link: https://www.econbiz.de/10011852720
Saved in:
Cover Image
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el; Glazik, Christian; Sauerland, Volkmar; … - In: Games 9 (2018) 1/2, pp. 1-12
Mastermind is a two players zero sum game of imperfect information. Starting with Erdos and Rényi (1963), its combinatorics have been studied to date by several authors, e.g., Knuth (1977), Chvátal (1983), Goodrich (2009). The first player, called “codemaker”, chooses a secret code and the...
Persistent link: https://www.econbiz.de/10011771356
Saved in:
Cover Image
Self-organisation migration technique for enhancing the permutation coded genetic algorithm
Dinesh, Kamala Kannan; Rajakumar, R.; Subramanian, R. - In: International journal of applied management science : IJAMS 13 (2021) 1, pp. 15-36
Persistent link: https://www.econbiz.de/10012505021
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...