Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
From MaRDI portal
Publication:2884510
DOI10.1287/ijoc.13.4.258.9733zbMath1238.90106OpenAlexW2097731353MaRDI QIDQ2884510
Vipul Jain, Ignacio E. Grossmann
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e5705054e08238044833e29c30b015e35270e605
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Constraint programming and operations research, Benders' cuts guided large neighborhood search for the traveling umpire problem, On the separability of subproblems in Benders decompositions, Finding reliable solutions: event-driven probabilistic constraint programming, Petroleum refinery optimization, Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals, A hybrid method for the planning and scheduling, An integrated method for planning and scheduling to minimize tardiness, Solving constrained optimization problems by solution-based decomposition search, A Benders approach for the constrained minimum break problem, Identifying and exploiting problem structures using explanation-based constraint programming, Scheduling and routing of automated guided vehicles: A hybrid approach, Operating room scheduling with generalized disjunctive programming, Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search, Combinatorial Benders' Cuts for the Strip Packing Problem, A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry, Optimizing the supply chain configuration for make-to-order manufacturing, A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles, Shop scheduling in manufacturing environments: a review, A conflict-directed approach to chance-constrained mixed logical linear programming, Scheduling inspired models for two-dimensional packing problems, Integrated production and material handling scheduling using mathematical programming and constraint programming, Single-facility scheduling by logic-based Benders decomposition, Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire, Constraint Integer Programming: A New Approach to Integrate CP and MIP, Multi-stage Benders Decomposition for Optimizing Multicore Architectures, The stop-and-drop problem in nonprofit food distribution networks, Scheduling of Jobs on Dissimilar Parallel Machine Using Computational Intelligence Algorithms, Balancing and scheduling of flexible mixed model assembly lines, Parallel machine scheduling with time constraints on machine qualifications, Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines, Integrating operations research in constraint programming, Integrating operations research in constraint programming, Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling, The Benders decomposition algorithm: a literature review, Changeover formulations for discrete-time mixed-integer programming scheduling models, Polylithic modeling and solution approaches using algebraic modeling systems, 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, Local search and constraint programming for the post enrolment-based course timetabling problem, A cutting plane approach for integrated planning and scheduling, Optimal resource allocation and scheduling for the CELL BE platform, Detecting infeasibility and generating cuts for mixed integer programming using constraint programming, Scheduling internal audit activities: a stochastic combinatorial optimization problem, Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip, Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm, Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags, A hybrid method for modeling and solving supply chain optimization problems with soft and logical constraints, SCIP: solving constraint integer programs, Robust Scheduling with Logic-Based Benders Decomposition, Optimal solutions for a dock assignment problem with trailer transportation, Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem, Data-driven feasibility analysis for the integration of planning and scheduling problems, Challenges in Enterprise Wide Optimization for the Process Industries, Logic-based MultiObjective Optimization for Restoration Planning, New lower bounds based on column generation and constraint programming for the pattern minimization problem, A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates, Cutting plane algorithms for solving a stochastic edge-partition problem, Integer-programming software systems
