554 research outputs found
Towards adualism: becoming and nihilism in Nietzsche's philosophy
This chapter argues that Nietzsche held two doctrines of becoming: one more radical, which he requires to fend off nihilism, and one much more moderate—the ontology of relations he develops under the label ‘will to power’. Based on the latter he develops what the author call his ‘adualistic’—neither monistic nor dualistic—practice of thought, a ‘simultaneity-thinking’ (Zugleich-Denken) that is no longer subject to nihilism. For Nietzsche’s belief in the reality of the threat of nihilism to be intelligible, the author attributes to Nietzsche at least three assumptions that underpin his entire project: (1) ‘what there is, is becoming (and not being)’, (2) ‘most (if not all) strongly believe in being’, and (3) nihilism is a function of the belief in being
The PEAST algorithm in sports scheduling: evolution of the major Finnish hockey league schedules
Nietzsche’s critique of staticism: Introduction to Nietzsche on time and history
Why are we still intrigued by Nietzsche? What the author argues in this chapter is that this sustained interest stems from Nietzsche’s challenge to what we might call the ‘staticism’ inherent in our ordinary experience. ‘Staticism’ can be defined, roughly speaking, as the view that the world is a collection of enduring, re-identifiable objects that change only very gradually and according to determinate laws. This article claims that as long as human beings subscribe to the ‘staticist picture’ Nietzsche will remain of interest. First, the chapter discusses Nietzsche’s rejection of the remnants of staticism in Hegel and Schopenhauer (both of whom, he holds, remain fundamentally opposed to taking time and history seriously). Second, it briefly outlines why Nietzsche deems the belief in any variant of the staticist picture as problematic. Finally, it examines Nietzsche’s adualistic-dialetheic stance towards the staticist worldview
Real-life instances of a non-commercial indoor football league
<p>This repository accompanies the paper 'Scheduling a Non-Commercial Indoor Football League: a Tabu Search Based Approach' (Van Bulck, Goossens, Spieksma (2017)). More specifically, it stores all input instances and the generated schedules.</p>
Exact algorithms for the matrix bid auction.
In a combinatorial auction, multiple items are for sale simultaneously to a set of buyers. These buyers are allowed to place bids on subsets of the available items. A special kind of combinatorial auction is the so-called matrix bid auction, which was developed by Day (2004). The matrix bid auction imposes restrictions on what a bidder can bid for a subsets of the items. This paper focusses on the winner determination problem, i.e. deciding which bidders should get what items. The winner determination problem of a general combinatorial auction is NP-hard and inapproximable. We discuss the computational complexity of the winner determination problem for a special case of the matrix bid auction. We present two mathematical programming formulations for the general matrix bid auction winner determination problem. Based on one of these formulations, we develop two branch-and-price algorithms to solve the winner determination problem. Finally, we present computational results for these algorithms and compare them with results from a branch-and-cut approach based on Day & Raghavan (2006).Algorithms; Bids; Branch-and-price; Combinatorial auction; Complexity; Computational complexity; Exact algorithm; Mathematical programming; Matrix; Matrix bids; Research; Winner determination;
- …
