Publication:4475618
From MaRDI portal
zbMath1067.68677MaRDI QIDQ4475618
Publication date: 9 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2239/22390016.htm
90C11: Mixed integer programming
90C59: Approximation methods and heuristics in mathematical programming
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Um modelo híbrido (CLP-MILP) para scheduling de operações em polidutos, Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles, Supplier selection in the processed food industry under uncertainty, A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks, Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip, A hybrid method for the planning and scheduling, An integrated method for planning and scheduling to minimize tardiness, Scheduling and routing of automated guided vehicles: A hybrid approach, Cutting plane algorithms for solving a stochastic edge-partition problem, Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm, Single-facility scheduling by logic-based Benders decomposition, A fast and accurate technique for mapping parallel applications on stream-oriented MPSoC platforms with communication awareness, A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates, Detecting infeasibility and generating cuts for mixed integer programming using constraint programming, Decomposition Methods for the Parallel Machine Scheduling Problem with Setups, Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles