Pages that link to "Item:Q2884510"

The following pages link to Algorithms for hybrid MILP/CP models for a class of optimization problems (Q2884510):

Displaying 50 items.

• Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals (Q322736) (← links)
• Solving constrained optimization problems by solution-based decomposition search (Q326460) (← links)
• Operating room scheduling with generalized disjunctive programming (Q342094) (← links)
• Scheduling inspired models for two-dimensional packing problems (Q421612) (← links)
• The stop-and-drop problem in nonprofit food distribution networks (Q478060) (← links)
• Balancing and scheduling of flexible mixed model assembly lines (Q481715) (← links)
• Optimal resource allocation and scheduling for the CELL BE platform (Q545538) (← links)
• A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles (Q614066) (← links)
• Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
• Polylithic modeling and solution approaches using algebraic modeling systems (Q691438) (← links)
• Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip (Q707694) (← links)
• SCIP: solving constraint integer programs (Q734351) (← links)
• Optimal solutions for a dock assignment problem with trailer transportation (Q744629) (← links)
• Integer-programming software systems (Q817202) (← links)
• On the separability of subproblems in Benders decompositions (Q846136) (← links)
• Finding reliable solutions: event-driven probabilistic constraint programming (Q846142) (← links)
• A hybrid method for the planning and scheduling (Q850451) (← links)
• An integrated method for planning and scheduling to minimize tardiness (Q850465) (← links)
• A Benders approach for the constrained minimum break problem (Q856212) (← links)
• Identifying and exploiting problem structures using explanation-based constraint programming (Q857888) (← links)
• Scheduling and routing of automated guided vehicles: A hybrid approach (Q858276) (← links)
• Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search (Q868140) (← links)
• A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry (Q878576) (← links)
• Scheduling internal audit activities: a stochastic combinatorial optimization problem (Q975756) (← links)
• New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240) (← links)
• Cutting plane algorithms for solving a stochastic edge-partition problem (Q1040087) (← links)
• Constraint programming and operations research (Q1616390) (← links)
• Petroleum refinery optimization (Q1642991) (← links)
• Parallel machine scheduling with time constraints on machine qualifications (Q1738819) (← links)
• Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling (Q1751262) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Changeover formulations for discrete-time mixed-integer programming scheduling models (Q1753514) (← links)
• Local search and constraint programming for the post enrolment-based course timetabling problem (Q1761894) (← links)
• A cutting plane approach for integrated planning and scheduling (Q1761978) (← links)
• A hybrid method for modeling and solving supply chain optimization problems with soft and logical constraints (Q1792697) (← links)
• A hybrid approach to scheduling with earliness and tardiness costs (Q1861936) (← links)
• Solving planning and scheduling problems with combined integer and constraint programming (Q1864438) (← links)
• Optimizing the supply chain configuration for make-to-order manufacturing (Q1926828) (← links)
• Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags (Q2018863) (← links)
• Nutmeg: a MIP and CP hybrid solver using branch-and-check (Q2226478) (← links)
• Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm (Q2268503) (← links)
• Data-driven feasibility analysis for the integration of planning and scheduling problems (Q2302362) (← links)
• Integrated production and material handling scheduling using mathematical programming and constraint programming (Q2433554) (← links)
• Single-facility scheduling by logic-based Benders decomposition (Q2442086) (← links)
• A fast and accurate technique for mapping parallel applications on stream-oriented MPSoC platforms with communication awareness (Q2481586) (← links)
• A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates (Q2482800) (← links)
• Detecting infeasibility and generating cuts for mixed integer programming using constraint programming (Q2489122) (← links)
• Robust Scheduling with Logic-Based Benders Decomposition (Q2806901) (← links)
• Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem (Q2815453) (← links)
• Benders' cuts guided large neighborhood search for the traveling umpire problem (Q2892136) (← links)