Results 61 to 70 of about 243,465 (164)
FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver
, 2000 We describe FATCOP 2.0, a new parallel mixed integer program solver that works in an opportunistic computing environment provided by the Condor resource management system.
Linderoth, Jeff +2 more
core
Optimal scheduling of smart home appliances using mixed-integer linear programming [PDF]
, 2012 In the last years we have witnessed an increasing interest in smart buildings, in particular for what concerns optimal energy management, renewable energy sources, and smart appliances.
Sartor, Giorgio
core
استخدام خوارزمية طريقة تطوير مو لد قطع المستوي لإيجاد الحل العددي لمسائل البرمجة الكسرية [PDF]
Engineering and Technology Journal, 2008 There are many methods for solving Fractional Programming problems thatgetting the optimal solution of the problem where the values of variables arefractional numbers not integer numbers, But when there are conditions in theproblem that requires the ...
doaj +1 more source
Note on Integer-Valued Bilinear Time Series Models
Summary. This note reconsiders the nonnegative integer-valued bilinear processes introduced by Doukhan, Latour, and Oraichi (2006). Using a hidden Markov argument, we extend their result of the existence of a stationary solution for the INBL(1,0,1,1 ...
Werker, B.J.M. +2 more
core +2 more sources
Algorithmic search for integer Abelian roots of a polynomial with integer Abelian coefficients [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. ИнформатикаIn this work, we consider the operations over Abelian integers of rank $n$. By definition, such numbers are elements of the complex field and have the form of polynomials with integer coefficients from the $n$th degree primitive root of 1.
Tsybulya, Liliya Mikhailovna
doaj +1 more source
Variable neighbourhood decomposition search for 0-1 mixed integer programs
, 2009 In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable neighbourhood search with a general-purpose CPLEX MIP solver.
Hanafi, S +7 more
core +1 more source
ANALYSING INTEGER DIVISION KNOWLEDGE AND SKILLS IN PROSPECTIVE PRIMARY TEACHERS
KalamatikaThis study aims to investigate prospective primary (MI) teachers’ knowledge of the sign of the division result of integers, their skills in illustrating the division model of integers, and their ability to perform integer division operations. This study
Dzikra Fu'adiah +2 more
doaj +1 more source
Convex approximations for a class of mixed-integer recourse models
We consider mixed-integer recourse (MIR) models with a single recourse constraint.We relate the secondstage value function of such problems to the expected simple integer recourse (SIR) shortage function.
Vlerk, Maarten H. van der
core
Testable implications of general equilibrium models: an integer programming approach. [PDF]
Focusing on the testable implications on the equilibrium manifold, we show that the rationalizability problem is NP-complete. Subsequently, we present an integer programming (IP) approach to characterizing general equilibrium models. This approach avoids
Cherchye, Laurens +2 more
core +2 more sources
, 2004 Lagrangean Relaxation has been successfully applied to process many well known instances of NP-hard Mixed Integer Programming problems. In this paper we present a Lagrangean Relaxation based generic solver for processing Mixed Integer Programming ...
Siamitros, C, Mitra, G, Poojari, CA
core