Pages that link to "Item:Q1751150"

The following pages link to Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150):

Displaying 50 items.

• A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
• Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
• A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem (Q1725600) (← links)
• Preprocessing and cut generation techniques for multi-objective binary programming (Q1755381) (← links)
• Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
• \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
• An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320) (← links)
• Some new perspectives for solving 0--1 integer programming problems using balas method (Q2051155) (← links)
• Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
• The effect of periodic disturbance patterns on the efficiency of active flow control in a linear stator cascade (Q2094197) (← links)
• A comparison of optimal, binary closed-loop active flow control applied to an annular compressor stator cascade with periodic disturbances (Q2094209) (← links)
• TCMI: a non-parametric mutual-dependence estimator for multivariate continuous distributions (Q2097447) (← links)
• Decomposition of loosely coupled integer programs: a multiobjective perspective (Q2097645) (← links)
• Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
• Optimal monomial quadratization for ODE systems (Q2115847) (← links)
• Heuristic methods for minimum-cost pipeline network design -- a node valency transfer metaheuristic (Q2129378) (← links)
• Boundedness and nuclearity of pseudo-differential operators on homogeneous trees (Q2144414) (← links)
• Stochastic global optimization algorithms: a systematic formal approach (Q2200687) (← links)
• Parallelization of a branch-and-bound algorithm for the maximum weight clique problem (Q2234743) (← links)
• Non-probabilistic interval model-based system reliability assessment for composite laminates (Q2322972) (← links)
• A comparative study on recently-introduced nature-based global optimization methods in complex mechanical system design (Q2633187) (← links)
• An exact branch-and-price approach for the medical student scheduling problem (Q2668624) (← links)
• A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761) (← links)
• Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks (Q2669733) (← links)
• Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
• Achieving consistency with cutting planes (Q2687054) (← links)
• Computational advances in polynomial optimization: RAPOSa, a freely available global solver (Q2689854) (← links)
• A new mathematical model for tiling finite regions of the plane with polyominoes (Q3303533) (← links)
• Optimal design of experiments for estimating the time of death in forensic medicine (Q4646408) (← links)
• (Q4969086) (← links)
• The Study of Depot Position Effect on Travel Distance in Order Picking Problem (Q5026178) (← links)
• Multivariable Branching: A 0-1 Knapsack Problem Case Study (Q5084602) (← links)
• Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded (Q5085481) (← links)
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
• Decomposition Branching for Mixed Integer Programming (Q5095180) (← links)
• A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching (Q5137961) (← links)
• A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems (Q5853569) (← links)
• Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
• Grouped variable selection with discrete optimization: computational and statistical perspectives (Q6046300) (← links)
• An integer linear programming approach to solving the Eternity puzzle (Q6076354) (← links)
• Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)
• Pilot pattern design scheme with branch and bound in PSA-OFDM system (Q6110960) (← links)
• A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
• Optimal \((0, 1)\)-matrix completion with majorization ordered objectives (Q6152556) (← links)
• Airline capacity distribution under financial budget and resource consideration (Q6173937) (← links)
• A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
• Time minimization and online synchronization for multi-agent systems under collaborative temporal logic tasks (Q6537337) (← links)
• Augmenting bi-objective branch and bound by scalarization-based information (Q6616273) (← links)
• New approach to solve unconstrained binary quadratic problem (Q6658442) (← links)
• Two-set inequalities for the binary knapsack polyhedra (Q6670502) (← links)