Similar Search Results

Strong bounds and exact solutions to the minimum broadcast time problem

Ivanova, Marika; Haugland, Dag; Tvedt, Bård Hennning - In: International transactions in operational research : a … 32 (2025) 1, pp. 314-352

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

Computational experiments with a cutting-plane algorithm for a time-indexed formulation

Berghman, Lotte; Spieksma, Frits C. R. - 2012

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

D- and I-optimal design of mixture experiments in the presence of ingredient availability constraints

Syafitri, Utami; Sartono, Bagus; Goos, Peter - 2015

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

Computational experiments with cross and crooked cross cuts

Dash, Sanjeeb; Günlük, Oktay; Vielma, Juan Pablo - In: INFORMS journal on computing : JOC 26 (2014) 4, pp. 780-797

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

Integer optimization with penalized fractional values : the Knapsack case

Malaguti, Enrico; Monaci, Michele; Paronuzzi, Paolo; … - In: European journal of operational research : EJOR 273 (2019) 3, pp. 874-888

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

MILP models for the selection of a small set of well-distributed points

D'Ambrosio, Claudia; Nannicini, Giacomo; Sartor, Giorgio - In: Operations research letters 45 (2017) 1, pp. 46-52

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

Integer programming approaches to find row-column arrangements of two-level orthogonal experimental designs

Nha Vo-Thanh; Goos, Peter; Schoen, Eric D. - 2016

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

An integer linear programming approach to find trend-robust run orders of experimental designs

Núñez Ares, José; Goos, Peter - 2016

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

Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem

Alidaee, Bahram; Ramalingam, Vijay P.; Wang, Haibo; … - In: Recent advances in optimization theory and applications, (pp. 3-19). 2018

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

Experiments with an Integer Programming Formulation of an Expert System

Dhar, Vasant - 2008

We present expert system (ES) and Integer Programming (IP) formulations of an NP-completeconstraint satisfaction problem (CSP). The problem involves generating aplan for assigning faculty to courses given a variety of constraints and preferences andother tentative data. The expert system...

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