Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 9 of 9 for “"Branching heuristic"”.

  1. A minimalist approach to deep multi-task learning

    … information. Finally, in the '<i>Generalisable Branching Heuristic for a SAT Solver</i>', we apply multi-task reinforcement learning to Boolean satisfiability, a fundamental problem in academia and industrial applications. We demonstrate that Q-learning, a staple reinforcement learning algorithm …

    oxford Repository record for A minimalist approach to deep multi-task learning (opens in a new tab)

  2. Machine Learning for SAT Solvers

    … time, it appears that the techniques and heuristics embedded in these solvers avert the worst-case exponential time in practice. The implementations of these various solver heuristics and techniques are vital to the solvers effectiveness in practice. The state-of-the-art heuristics and …

    waterloo Repository record for Machine Learning for SAT Solvers (opens in a new tab)

  3. An implementation of a constraint branching algorithm for optimally solving airline crew pairing problems

    … is often only partially explored. A constraint branching heuristic called connection fixing often selects branches containing optimal or near-optimal solutions. This thesis investigates utilizing connection fixing in a branchand-price algorithm to exactly solve airline crew scheduling problems. …

    chalmers Repository record for An implementation of a constraint branching algorithm for optimally solving airline crew pairing problems (opens in a new tab)

  4. Applications of chance constrained optimization in operations management

    … approximations are presented, as well as a branching heuristic for sample approximation lower bounds and an iterative algorithm for improved convex approximation upper bounds. The final application is in risk management for parimutuel horse racing wagering. We develop a methodology to limit …

    mcmaster Repository record for Applications of chance constrained optimization in operations management (opens in a new tab)

  5. A Machine Learning Approach for Optimizing Heuristic Decision-making in OWL Reasoners

    … behavior is often controlled by heuristics that are based on insufficient information. This thesis proposes a novel OWL reasoning approach that applies machine learning (ML) to implement pragmatic and optimal decision-making strategies in such situations. Disjunctions occurring in …

    concordia Download PDF for A Machine Learning Approach for Optimizing Heuristic Decision-making in OWL Reasoners (opens in a new tab)

  6. Unified Framework for Neural Network Verification with Hybrid Zonotopes

    … (BaB) refinement stage with a basic branching heuristic, providing a basis for future development of adaptive or parallelized search strategies. Extensive experiments on MNIST and CIFAR-10 robustness benchmarks demonstrate that, within the over-approximation stage, the proposed Hybrid …

    unsw Repository record for Unified Framework for Neural Network Verification with Hybrid Zonotopes (opens in a new tab)

  7. Contributions to Data-Driven Combinatorial Solvers

    … ML-based exact model counter by improving the branching heuristic of a conventional solver in a data-driven manner. We show that the resulting solver takes fewer steps in solving unseen similarly distributed instances and can extrapolate to larger instances from the same problem family, …

    toronto-retro Repository record for Contributions to Data-Driven Combinatorial Solvers (opens in a new tab)

  8. Optimal Reassignment of Flights to Gates Focusing on Transfer Passengers

    … we embed the formulation in an MIP-based metaheuristic framework using Variable Neighborhood Search with Local Branching (VNS-LB). We explore the key notion of a solution neighborhood in the context of gate assignment, given that transfer passengers are our main consideration. Our …

    maryland Repository record for Optimal Reassignment of Flights to Gates Focusing on Transfer Passengers (opens in a new tab)

  9. Optimal Shipping Decisions in an Airfreight Forwarding Network

    … of network flow problems. The second is a local branching heuristic that combines branching ideas and local search. The two approaches show promising results in providing good quality heuristic solutions within reasonable computational times, for difficult and large shipment consolidation …

    waterloo Repository record for Optimal Shipping Decisions in an Airfreight Forwarding Network (opens in a new tab)