Search Results - subject:"Integer Programming"

Quick evaluation of the efficient solution set for the biobjective knapsack problem

Gandibleux, Xavier - In: Multiple criteria decision making in the new millennium …, (pp. 254-264). 2001

Persistent link: https://www.econbiz.de/10001695520

An interactive genetic algorithm applied to the multiobjective knapsack problem

Pamuk, Selcen; Köksalan, Murat - In: Multiple criteria decision making in the new millennium …, (pp. 265-272). 2001

Persistent link: https://www.econbiz.de/10001695523

A theoretical framework for association mining based on the Boolean Retrieval Model

Bollmann-Sdorra, Peter; Hafez, Alaaeldin M.; Raghavan, … - In: Data warehousing and knowledge discovery : third …, (pp. 21-30). 2001

Persistent link: https://www.econbiz.de/10001694684

A mixed-integer programming formulation for the ELSP with sequence-dependent setup-costs and setup-times

Biskup, Dirk - 2001

Persistent link: https://www.econbiz.de/10001646935

Thebinary knapsack problem : solutions with guaranteed quality

Ghosh, Diptesh; Goldengorin, Boris - 2001

Persistent link: https://www.econbiz.de/10001648692

A DEA-BASED APPROACH TO RANKING MULTI-CRITERIA ALTERNATIVES

KÖKSALAN, MURAT; TUNCER, CEREN - In: International Journal of Information Technology & … 08 (2009) 01, pp. 29-54

We propose a data envelopment analysis (DEA)-based approach to ranking multi-criteria alternatives. We call it "the area of the efficiency score graph" (AES) approach. Unlike the classical DEA score and Dk measure that counts the number of DMUs (alternatives in DEA terminology) that should be...

Persistent link: https://www.econbiz.de/10004971680

Multi-objective integer programming: A general approach for generating all non-dominated solutions

Özlen, Melih; Azizoglu, Meral - In: European Journal of Operational Research 199 (2009) 1, pp. 25-35

with fewer objectives. We first provide the classical [epsilon]-constraint method on the bi-objective integer programming …In this paper we develop a general approach to generate all non-dominated solutions of the multi-objective integer … programming (MOIP) Problem. Our approach, which is based on the identification of objective efficiency ranges, is an improvement …

Persistent link: https://www.econbiz.de/10004973594

Risk neutral and risk averse power optimization in electricity networks with dispersed generation

Kuhn, Sebastian; Schultz, Rüdiger - In: Mathematical Methods of Operations Research 69 (2009) 2, pp. 353-367

Models and algorithms for risk neutral and risk averse power optimization under uncertainty are presented. The approach differs from previous ones by incorporating the transmission network explicitly. Copyright Springer-Verlag 2009

Persistent link: https://www.econbiz.de/10010999717

On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming

Escudero, Laureano - In: TOP: An Official Journal of the Spanish Society of … 17 (2009) 1, pp. 5-29

Persistent link: https://www.econbiz.de/10004995459

Scramble Teams for the Pinehurst Terrapin Classic

Ball, Michael; Halper, Russell - In: Journal of Quantitative Analysis in Sports 5 (2009) 2, pp. 10-10

the past four years, both a simple interactive, spreadsheet-based heuristic and an integer programming model have been …

Persistent link: https://www.econbiz.de/10005046694