Results 1  10
of
15
Evaluating asp and commercial solvers on the CSPLib (preliminary work
 In WLP
, 2006
"... 1 Introduction The last decade has witnessed a large effort in the development of solvers for combinatorial problems. The traditional approach based on writing ad hoc algorithms and programs (complete, such as backtracking, or incomplete, such as tabu search, simulated annealing, etc.) or translati ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
.) or translating ina format suitable for Integer Programming solvers (e.g., Ilog Cplex1), has been challenged bythe use of libraries for Constraint Programming (CP), e.g., Ilog
A Stochastic Optimization Case Study using ILOG CPLEX Concert Technology: Dual Sourcing Model for Managing Supply Chain Disruptions
"... A two stage stochastic programming model for incorporating demand uncertainty and disruptions in supply chain is described and implemented using ILOG CPLEX Concert Technology. Exchange rate variation is also considered along with other uncertainties for foreign supplier selection. The model is focus ..."
Abstract
 Add to MetaCart
A two stage stochastic programming model for incorporating demand uncertainty and disruptions in supply chain is described and implemented using ILOG CPLEX Concert Technology. Exchange rate variation is also considered along with other uncertainties for foreign supplier selection. The model
Chapter 19 Empirical Hardness Models for Combinatorial Auctions
"... In this chapter we consider the empirical hardness of the winner determination problem. We identify distributionnonspecific features of data instances and then use statistical regression techniques to learn, evaluate and interpret a function from these features to the predicted hardness of an insta ..."
Abstract
 Add to MetaCart
of an instance, focusing mostly on ILOG’s CPLEX solver. We also describe two applications of these models: building an algorithm portfolio that selects among different WDP algorithms, and inducing test distributions that are harder for this algorithm portfolio. 1
SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers
"... Abstract. Many highly sophisticated tools exist for solving linear arithmetic optimization and feasibility problems. Here we analyze why it is difficult to use these tools inside systems for SAT Modulo Theories (SMT) for linear arithmetic: one needs support for disequalities, strict inequalities and ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
, the newest version of ILOG CPLEX and our own new Barcelogic Tsolver for arithmetic, we show that, interestingly, the cost of result checking is only a small fraction of the total Tsolver time. Third, we report on extensive experiments running exactly the same SMT search using CPLEX and Barcelogic as T
A hybrid method for planning and scheduling
 In Procs. of the 10th Intern. Conference on Principles and Practice of Constraint Programming  CP 2004
, 2004
"... We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logicbased Benders decomposition. Tasks assigned to a facility may run in par ..."
Abstract

Cited by 44 (7 self)
 Add to MetaCart
programming (ILOG Scheduler). As a result we solve larger instances to optimality than could be solved previously. In minimum makespan problems, the Benders method provides a feasible solution and a lower bound on the optimal makespan even when it is terminated before finding a provably optimal solution. 1
An Efficient Memetic, PermutationBased Evolutionary Algorithm for
"... Abstract Train timetabling is a difficult and very tightly constrained combinatorial problem that deals with the construction of train schedules. We focus on the particular problem of local reconstruction of the schedule following a small perturbation, seeking minimisation of the total accumulated ..."
Abstract
 Add to MetaCart
the permutation. This algorithm can be hybridised with ILOG’s commercial Mixed Integer Programming (MIP) tool CPLEX in a coarsegrained manner: the evolutionary part is used to quickly obtain a good but suboptimal solution and this intermediate solution is refined using CPLEX. Experimental results are presented
A Maximum Matching Based Heuristic Algorithm for Partial Latin Square Extension Problem
"... Abstract—A partial Latin square (PLS) is an assignment of n symbols to an n × n grid such that, in each row and in each column, each symbol appears at most once. The partial Latin square extension (PLSE) problem asks to find such a PLS that is a maximum extension of a given PLS. The PLSE problem is ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. Specifically, the proposed algorithm delivers a better solution than the original one and local search. Besides, when computation time is limited due to an application reason, it delivers a better solution than IBM ILOG CPLEX, a stateoftheart optimization solver, especially for large scale “hard ” instances
Scheduling Problem Solutions in Transport Enterprises
"... Abstract – The classical transportation problem is a problem of optimal transportation plan of a homogeneous product of uniform items in the presence of homogeneous items of consumption on homogeneous vehicles with static data and the linear approach [1]. Development and application of optimal schem ..."
Abstract
 Add to MetaCart
satisfies all companies ’ needs. In this article we will consider the process of modeling in IBM ILOG CPLEX Optimizer. This software includes efficient algorithms for solving optimization problems.
A Branchandcut Procedure for the Udine Course Timetabling Problem
 PROCEEDINGS OF THE 7TH PATAT CONFERENCE
, 2008
"... This paper describes a branchandcut procedure for an extension of the bounded colouring problem, generally known as curriculumbased university course timetabling. In particular, we focus on Udine Course Timetabling [di Gaspero and Schaerf, J. Math. Model. Algorithms 5:1], which has been used in ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
of instruction and free days, and all related separation routines. We also discuss applicability of standard cuts from graph colouring and weighted matching. The results of our preliminary experimentation with an implementation using ILOG Concert and CPLEX 10 are provided. Within 15 minutes, it is possible
Research Article The Development of Mathematical Model for a University Course Timetabling Problem
, 2011
"... This research is to study the problem of classroom timetable generating due to an increase amount of student. The generator of classroom timetable needs to arrange it properly according to the limited resources, i.e., a number of classrooms, loading capacity of classroom, periods, and number of teac ..."
Abstract
 Add to MetaCart
) the least extraperiod spending. The programs used for the mathematical solution in this research are IBM ILOG CPLEX 12.2. The result was found that solving the classroom timetable problem using a mathematical model could reduce the costs of 8,115 baht / week and the extraperiods required could be reduced
Results 1  10
of
15