References of "Annals of Operations Research"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailBatch mode reinforcement learning based on the synthesis of artificial trajectories
Fonteneau, Raphaël ULg; Murphy, Susan A.; Wehenkel, Louis ULg et al

in Annals of Operations Research (2013), 208(1), 383-416

Detailed reference viewed: 89 (24 ULg)
Full Text
Peer Reviewed
See detailThe Mathematics of Peter L. Hammer (1936-2006): Graphs, Optimization, and Boolean Models
Boros, Endre; Crama, Yves ULg; de Werra, Dominique et al

in Annals of Operations Research (2011), 188

This volume contains a collection of papers published in memory of Peter L. Hammer (1936-2006). Peter Hammer made substantial contributions to several areas of operations research and discrete mathematics ... [more ▼]

This volume contains a collection of papers published in memory of Peter L. Hammer (1936-2006). Peter Hammer made substantial contributions to several areas of operations research and discrete mathematics, including, in particular, mathematical programming (linear and quadratic 0--1 programming, pseudo-Boolean optimization, knapsack problems, etc.), combinatorial optimization (transportation problems, network flows, MAXSAT, simple plant location, etc.), graph theory (special classes of graphs, stability problems, and their applications), data mining and classification (Logical Analysis of Data), and, last but not least, Boolean theory (satisfiability, duality, Horn functions, threshold functions, and their applications). The volume contains 23 contributed papers along these lines. [less ▲]

Detailed reference viewed: 61 (9 ULg)
Full Text
Peer Reviewed
See detailLogical Analysis of Data: Classification with justification
Boros, Endre; Crama, Yves ULg; Hammer, Peter L. et al

in Annals of Operations Research (2011), 188

Learning from examples is a frequently arising challenge, with a large number of algorithms proposed in the classification, data mining and machine learning literature. The evaluation of the quality of ... [more ▼]

Learning from examples is a frequently arising challenge, with a large number of algorithms proposed in the classification, data mining and machine learning literature. The evaluation of the quality of such algorithms is frequently carried out ex post, on an experimental basis: their performance is measured either by cross validation on benchmark data sets, or by clinical trials. Few of these approaches evaluate the learning process ex ante, on its own merits. In this paper, we dis- cuss a property of rule-based classifiers which we call "justifiability", and which focuses on the type of information extracted from the given training set in order to classify new observations. We investigate some interesting mathematical properties of justifiable classifiers. In partic- ular, we establish the existence of justifiable classifiers, and we show that several well-known learning approaches, such as decision trees or nearest neighbor based methods, automatically provide justifiable clas- sifiers. We also identify maximal subsets of observations which must be classified in the same way by every justifiable classifier. Finally, we illustrate by a numerical example that using classifiers based on "most justifiable" rules does not seem to lead to over fitting, even though it involves an element of optimization. [less ▲]

Detailed reference viewed: 69 (5 ULg)
Full Text
Peer Reviewed
See detailSpace and time allocation in a shipyard assembly hall
Bay, Maud ULg; Crama, Yves ULg; Langer, Yves et al

in Annals of Operations Research (2010), 179(1), 57-76

We present a space and time allocation problem that arises in assembly halls producing large building blocks (namely, a shipyard which assembles prefabricated keel elements). The building blocks are very ... [more ▼]

We present a space and time allocation problem that arises in assembly halls producing large building blocks (namely, a shipyard which assembles prefabricated keel elements). The building blocks are very large, and, once a block is placed in the hall, it cannot be moved until all assembly operations on this block are complete. Each block must be processed during a predetermined time window. The objective is to maximize the number of building blocks produced in the hall. The problem is modeled as a 3-dimensional bin packing problem (3D-BPP) and is handled by a Guided Local Search heuristic initially developed for the 3D-BPP. Our com- putational experiments with this heuristic demonstrate that excellent results can be found within minutes on a workstation, and that the heuristic outperforms a standard constraint programming approach. We also describe some additional real-life constraints arising in the industrial application and show how these constraints can be conveniently integrated in the model. [less ▲]

Detailed reference viewed: 186 (37 ULg)
Full Text
Peer Reviewed
See detailOptimal selection of a portfolio of options under Value-at-Risk constraints: a scenario approach
Schyns, Michael ULg; Crama, Yves ULg; Hübner, Georges ULg

in Annals of Operations Research (2010), 181

This paper introduces a multiperiod model for the optimal selection of a financial portfolio of options linked to a single index. The objective of the model is to maximize the expected return of the ... [more ▼]

This paper introduces a multiperiod model for the optimal selection of a financial portfolio of options linked to a single index. The objective of the model is to maximize the expected return of the portfolio under constraints limiting its Value-at-Risk. We rely on scenarios to represent future security prices. The model contains several interesting features, like the consideration of transaction costs, bid-ask spreads, arbitrage-free option pricing, and the possibility to rebalance the portfolio with options introduced at the start of each period. The resulting mixed integer programming model is applied to realistic test instances involving options on the S&P500 index. In spite of the large size and of the numerical difficulty of this model, near-optimal solutions can be computed by a standard branch-and-cut solver or by a specialized heuristic. The structure and the financial features of the selected portfolios are also investigated. [less ▲]

Detailed reference viewed: 122 (30 ULg)
Full Text
Peer Reviewed
See detailLifting, Superadditivity, Mixed Integer Rounding and Single Node Flow Sets Revisited
Louveaux, Quentin ULg; Wolsey, Laurence A.

in Annals of Operations Research (2007), 153(1), 47-77

In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure com- bining mixed integer rounding with lifting for ... [more ▼]

In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure com- bining mixed integer rounding with lifting for the development of strong valid inequalities for knapsack and single node flow sets. Our hope is that the latter can be used in practice to generate cutting planes for mixed integer programs. The survey contains essentially two parts. In the first we present lifting in a very general way, emphasizing superadditive lifting which allows one to lift simultane- ously different sets of variables. In the second, our procedure for generating strong valid inequalities consists of reduction to a knapsack set with a single continuous variable, construction of a mixed integer rounding inequality, and superaddilifting. It is applied to several generalizations of the 0-1 single node flow set. [less ▲]

Detailed reference viewed: 53 (10 ULg)
Full Text
Peer Reviewed
See detailCyclic scheduling in robotic flowshops
Crama, Yves ULg; Kats, Vladimir; Van de Klundert, Joris et al

in Annals of Operations Research (2000), 96

Fully automated production cells consisting of flexible machines and a material handling robot have become commonplace in contemporary manufacturing systems. Much research on scheduling problems arising ... [more ▼]

Fully automated production cells consisting of flexible machines and a material handling robot have become commonplace in contemporary manufacturing systems. Much research on scheduling problems arising in such cells, in particular, in flowshop-like production cells has been reported recently. Although there are many differences between the models, they all explicitly incorporate the interaction between the materials handling and the classical job processing decisions, since this interaction determines the efficiency of the cell. This paper surveys cyclic scheduling problems in robotic flowshops, models for such problems, and the complexity of solving these problems, thereby bringing together several streams of research that have by and large ignored one another, and describing and establishing links with other scheduling problems and combinatorial topics. [less ▲]

Detailed reference viewed: 12 (0 ULg)
Full Text
Peer Reviewed
See detailHitting or avoiding balls in Euclidean space
Crama, Yves ULg; Ibaraki, Toshihide

in Annals of Operations Research (1997), 69

We investigate the algorithmic complexity of several geometric problems of the following type: given a "feasible" box and a collection of balls in Euclidean space, find a feasible point which is covered ... [more ▼]

We investigate the algorithmic complexity of several geometric problems of the following type: given a "feasible" box and a collection of balls in Euclidean space, find a feasible point which is covered by as few or, respectively, by as many balls as possible. We establish that all these problems are NP-hard in their most general version. We derive tight lower and upper bounds on the complexity of their one-dimensional versions. Finally, we show that all these problems can be solved in polynomial time when the dimension of the space is fixed. [less ▲]

Detailed reference viewed: 16 (1 ULg)
Full Text
Peer Reviewed
See detailValid inequalities and facets for a hypergraph model of the nonlinear knapsack and FMS part-selection problems
Crama, Yves ULg; Mazzola, Joseph B.

in Annals of Operations Research (1995), 58

This paper defines the dense subhypergraph problem (DSP), which provides a modelling framework for the nonlinear knapsack problem and other well-known problems arising in areas such as capital budgeting ... [more ▼]

This paper defines the dense subhypergraph problem (DSP), which provides a modelling framework for the nonlinear knapsack problem and other well-known problems arising in areas such as capital budgeting, flexible manufacturing system production planning, repair-kit selection, and compiler construction. We define several families of valid inequalities and state conditions under which these inequalities are facet-defining for DSP. We also explore the polyhedral structure of the cardinality-constrained DSP. Finally, we examine a special case of this problem that arises, for example, within the context of Lagrangian decomposition. For this case, we present a complete description of the convex hull of the feasible region. [less ▲]

Detailed reference viewed: 11 (1 ULg)
Full Text
Peer Reviewed
See detailCause-effect relationships and partially defined Boolean functions
Crama, Yves ULg; Ibaraki, Toshihide

in Annals of Operations Research (1988), 16

This paper investigates the use of Boolean techniques in a systematic study of cause-effect relationships. The model uses partially defined Boolean functions. Procedures are provided to extrapolate from ... [more ▼]

This paper investigates the use of Boolean techniques in a systematic study of cause-effect relationships. The model uses partially defined Boolean functions. Procedures are provided to extrapolate from limited observations, concise and meaningful theories to explain the effect under study, and to prevent (or provoke) its occurrence [less ▲]

Detailed reference viewed: 22 (2 ULg)