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, Stochastic Planning and Scheduling with Logic-Based Benders Decomposition, Team Orienteering with Time-Varying Profit, Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation, Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems, Logic-based Benders decomposition for wildfire suppression, Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition, Combining optimisation and simulation using logic-based Benders decomposition, Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition, Multi-depot electric vehicle scheduling in in-plant production logistics considering non-linear charging models, 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, Constraint programming and operations research, An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem, A branch-and-check approach for a wind turbine maintenance scheduling problem, Logic based Benders' decomposition for orthogonal stock cutting problems, A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking, Solving a selective dial-a-ride problem with logic-based Benders decomposition, The Benders decomposition algorithm: a literature review, Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling, Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework, Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut, The multiphase course timetabling problem, Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound, New formulations and solution approaches for the latency location routing problem, Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling, Nutmeg: a MIP and CP hybrid solver using branch-and-check, Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm, A branch-and-price-and-check model for the vehicle routing problem with location congestion, 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, Branch-and-check approaches for the tourist trip design problem with rich constraints, A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem, Decomposition Methods for the Parallel Machine Scheduling Problem with Setups, Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles, Logic-Based Benders Decomposition for Large-Scale Optimization
