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:"Fill's algorithm"
Narrow search

Narrow search

Year of publication
Subject
All
Algorithm 2 Algorithmus 2 Coupling from the past 2 Fill's algorithm 2 Markov Chain Monte Carlo 2 Packing problem 2 Packproblem 2 Stochastic processes 2 Theorie 2 Theory 2 Bottom-left-fill algorithm 1 Cutting 1 Cutting and packing 1 Heuristics 1 Heuristik 1 Mathematical programming 1 Mathematische Optimierung 1 Nesting problems 1 Operations Research 1 Operations research 1 Semi-discrete representation 1 Sweep-line algorithm 1 deepest-left-bottom-fill algorithm 1 geometry 1 parallelisation 1 semi-discrete representation 1
more ... less ...
Online availability
All
Undetermined 2
Type of publication
All
Article 2 Book / Working Paper 2
Type of publication (narrower categories)
All
Article in journal 2 Aufsatz in Zeitschrift 2
Language
All
English 2 Undetermined 2
Author
All
Casella, George 2 Chehrazad, Sahar 2 Lavine, Michael 2 Robert, Christian P. 2 Roose, Dirk 2 Wauters, Tony 2
Institution
All
Université Paris-Dauphine 1 Université Paris-Dauphine (Paris IX) 1
Published in...
All
Economics Papers from University Paris Dauphine 1 European journal of operational research : EJOR 1 International journal of production research 1 Open Access publications from Université Paris-Dauphine 1
Source
All
ECONIS (ZBW) 2 RePEc 2
Showing 1 - 4 of 4
Cover Image
A fast and scalable deepest-left-bottom-fill algorithm to solve irregular 3D cutting and packing problems using a semi-discrete representation
Chehrazad, Sahar; Roose, Dirk; Wauters, Tony - In: International journal of production research 63 (2025) 18, pp. 6606-6629
Persistent link: https://www.econbiz.de/10015468177
Saved in:
Cover Image
A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
Chehrazad, Sahar; Roose, Dirk; Wauters, Tony - In: European journal of operational research : EJOR 300 (2022) 3, pp. 809-826
Persistent link: https://www.econbiz.de/10013207306
Saved in:
Cover Image
Explaining the Perfect Sampler.
Casella, George; Lavine, Michael; Robert, Christian P. - Université Paris-Dauphine - 2001
In 1996, Propp and Wilson introduced coupling from the past (CFTP), an algorithm for generating a sample from the exact stationary distribution of a Markov chain. In 1998, Fill proposed another so–called perfect sampling algorithm. These algorithms have enormous potential in Markov Chain Monte...
Persistent link: https://www.econbiz.de/10009018425
Saved in:
Cover Image
Explaining the Perfect Sampler
Casella, George; Lavine, Michael; Robert, Christian P. - Université Paris-Dauphine (Paris IX) - 2001
In 1996, Propp and Wilson introduced coupling from the past (CFTP), an algorithm for generating a sample from the exact stationary distribution of a Markov chain. In 1998, Fill proposed another so–called perfect sampling algorithm. These algorithms have enormous potential in Markov Chain Monte...
Persistent link: https://www.econbiz.de/10011162138
Saved in:
A service of the
zbw
FAQ-Assistent (beta)
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...