Pages that link to "Item:Q4274629"

The following pages link to Solving Airline Crew Scheduling Problems by Branch-and-Cut (Q4274629):

Displaying 50 items.

• Solving a multi-objective interval crew-scheduling problem via genetic algorithms (Q1929495) (← links)
• Conflict graphs in solving integer programming problems (Q1969889) (← links)
• Valid integer polytope (VIP) penalties for branch-and-bound enumeration (Q1977646) (← links)
• Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
• Spherical classification of data, a new rule-based learning method (Q2038210) (← links)
• Distributed integral column generation for set partitioning problems (Q2139355) (← links)
• Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint (Q2177831) (← links)
• Dynamic constraint aggregation for solving very large-scale airline crew pairing problems (Q2226471) (← links)
• Integral simplex using double decomposition for set partitioning problems (Q2273675) (← links)
• Improving set partitioning problem solutions by zooming around an improving direction (Q2288990) (← links)
• Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut (Q2299984) (← links)
• A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
• Subadditive approaches in integer programming (Q2371344) (← links)
• An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
• A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)
• Modeling and solving a crew assignment problem in air transportation (Q2432845) (← links)
• Measuring the impact of primal heuristics (Q2450740) (← links)
• A new modeling and solution approach for the set-partitioning problem (Q2456638) (← links)
• A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
• Metaheuristics approach to the aircrew rostering problem (Q2468747) (← links)
• Effective search space control for large and/or complex driver scheduling problems (Q2468754) (← links)
• A LP-based heuristic for a time-constrained routing problem (Q2491773) (← links)
• Gomory cuts revisited (Q2564234) (← links)
• Vehicle and crew scheduling for urban bus lines (Q2575569) (← links)
• Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
• Enhancing CLP branch and bound techniques for scheduling problems (Q2721220) (← links)
• Solving a truck dispatching scheduling problem using branch-and-cut (Q2781096) (← links)
• The operational airline crew scheduling problem (Q2783811) (← links)
• A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem (Q2811322) (← links)
• Linear temporal logic vehicle routing with applications to multi-UAV mission planning (Q2903986) (← links)
• A branch-and-cut algorithm for partition coloring (Q3057147) (← links)
• Production systems with limited repair capacity (Q3165905) (← links)
• Some aspects on solving transportation problem (Q3388797) (← links)
• (Q4353151) (← links)
• Airline Crew Scheduling with Time Windows and Plane-Count Constraints (Q4408703) (← links)
• A Set Partitioning Approach to the Crew Scheduling Problem (Q4545655) (← links)
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
• Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization (Q5084606) (← links)
• Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
• Use of hidden network structure in the set partitioning problem (Q5101414) (← links)
• Learning in Combinatorial Optimization: What and How to Explore (Q5144784) (← links)
• RANDOM SEEKING: A GENERAL, EFFICIENT, AND INFORMED RANDOMIZED SCHEME FOR DYNAMIC LOAD BALANCING (Q5249038) (← links)
• Searching for optimal integer solutions to set partitioning problems using column generation (Q5416769) (← links)
• Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
• A set packing model for the ground holding problem in congested networks (Q5935422) (← links)
• An enhanced rostering model for airline crews (Q5939972) (← links)
• A branch-and-cut algorithm for the maximum cardinality stable set problem (Q5940036) (← links)
• Combined bus and driver scheduling (Q5952786) (← links)
• Airline cockpit crew scheduling (Q5953339) (← links)
• Optimal construction of airline individual crew pairings. (Q5959080) (← links)