Showing 1 - 10 of 1,268
We examine a variant of the uncapacitated lot-sizing model of Wagner-Whitin involving sales instead of fixed demands, and lower bounds on stocks. Two extended formulations are presented, as well as a dynamic programming algorithm and a complete description of the convex hull of solutions. When...
Persistent link: https://www.econbiz.de/10005043430
classification of decision making in large enterprises; outlines the centralization decentralization theory and the iterative process …
Persistent link: https://www.econbiz.de/10010966852
classification also identifies valuable theory types not presently embraced by any heterodox approach. Heterodoxy needs also to … open to a wide range of theories and methods, and the study of all relevant phenomena. A classification of the different … methods and theory types used by scholars identifies key strengths and weaknesses of each. Different schools of heterodox …
Persistent link: https://www.econbiz.de/10010885983
ideas of concept lattice and formal context, along with the IF ideas of classification (= formal context), infomorphism …, theory, interpretation and local logic. Ontology Markup Language (OML), a subset of CKML that is a self-sufficient markup …
Persistent link: https://www.econbiz.de/10005727137
Persistent link: https://www.econbiz.de/10005155633
Persistent link: https://www.econbiz.de/10005061252
Geometric branch-and-bound techniques are well-known solution algorithms for non-convex continuous global optimization problems with box constraints. Several approaches can be found in the literature differing mainly in the bounds used.
Persistent link: https://www.econbiz.de/10011052715
We propose a family of retrospective optimization (RO) algorithms for optimizing stochastic systems with both integer and continuous decision variables. The algorithms are continuous search procedures embedded in a RO framework using dynamic simplex interpolation (RODSI). By decreasing...
Persistent link: https://www.econbiz.de/10011052755
We consider a two-stage defender-attacker game that takes place on a network, in which the attacker seeks to take control over (or “influence”) as many nodes as possible. The defender acts first in this game by protecting a subset of nodes that cannot be influenced by the attacker. With full...
Persistent link: https://www.econbiz.de/10010998261
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms...
Persistent link: https://www.econbiz.de/10010999550