Pages that link to "Item:Q621754"
From MaRDI portal
The following pages link to Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754):
Displaying 50 items.
- A column generation approach for locating roadside clinics in Africa based on effectiveness and equity (Q323452) (← links)
- Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q339586) (← links)
- Column generation for extended formulations (Q458128) (← links)
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
- A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads (Q724007) (← links)
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem (Q724050) (← links)
- Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times (Q1652516) (← links)
- The vehicle routing problem with service level constraints (Q1681277) (← links)
- A branch-and-price algorithm for the aperiodic multi-period service scheduling problem (Q1694820) (← links)
- Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty (Q1713736) (← links)
- Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times (Q1754111) (← links)
- The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
- Perspectives on integer programming for time-dependent models (Q2001858) (← links)
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
- A branch-and-price procedure for clustering data that are graph connected (Q2060392) (← links)
- New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
- Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers (Q2077972) (← links)
- A branch-and-price approach for the continuous multifacility monotone ordered median problem (Q2106721) (← links)
- Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times (Q2147050) (← links)
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
- On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events (Q2242370) (← links)
- Exact algorithms for the traveling salesman problem with draft limits (Q2256207) (← links)
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria (Q2283297) (← links)
- A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties (Q2285347) (← links)
- Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)
- A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production (Q2669527) (← links)
- Exact solution of network flow models with strong relaxations (Q2689828) (← links)
- A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems (Q2806861) (← links)
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)
- A column-generation-based algorithm for a resource-constrained project scheduling problem with a fractional shared resource (Q5059351) (← links)
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation (Q5131729) (← links)
- A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching (Q5137961) (← links)
- An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems (Q5139849) (← links)
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
- Stabilizing branch‐and‐price for constrained tree problems (Q5326785) (← links)
- An exact algorithm for the service network design problem with hub capacity constraints (Q6085889) (← links)
- Configuration‐based approach for topological problems in the design of wireless sensor networks (Q6088118) (← links)
- Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time (Q6090472) (← links)
- Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm (Q6106600) (← links)
- Scalable timing-aware network design via Lagrangian decomposition (Q6112744) (← links)
- Dynamic scheduling of patients in emergency departments (Q6113312) (← links)
