Pages that link to "Item:Q5519733"
From MaRDI portal
The following pages link to Branch-and-Bound Methods: A Survey (Q5519733):
Displaying 50 items.
- Global solutions to folded concave penalized nonconvex learning (Q282459) (← links)
- Tikhonov, Ivanov and Morozov regularization for support vector machine learning (Q285946) (← links)
- Static and dynamic resource allocation models for recovery of interdependent systems: application to the Deepwater Horizon oil spill (Q314779) (← links)
- Solving constrained optimization problems by solution-based decomposition search (Q326460) (← links)
- Multi-operator based biogeography based optimization with mutation for global numerical optimization (Q356256) (← links)
- Exploring or reducing noise? A global optimization algorithm in the presence of noise (Q382006) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- Models and algorithms to improve earthwork operations in road design using mixed integer linear programming (Q421690) (← links)
- Testing restorable systems: formal definition and heuristic solution based on river formation dynamics (Q470035) (← links)
- Weighted heuristic anytime search: new schemes for optimization over graphical models (Q513336) (← links)
- Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems (Q522420) (← links)
- An efficient data structure for branch-and-bound algorithm (Q558042) (← links)
- An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
- A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm (Q652663) (← links)
- Disturbance rejection control based on state-reconstruction and persistence disturbance estimation (Q682676) (← links)
- Branch and bound algorithms for maximizing expected improvement functions (Q710752) (← links)
- A perturb biogeography based optimization with mutation for global numerical optimization (Q720655) (← links)
- Polynomial-time approximation algorithms for anchor-free TDoA localization (Q742410) (← links)
- General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768) (← links)
- Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems (Q868630) (← links)
- A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization (Q1015314) (← links)
- Relaxed maximum a posteriori fault identification (Q1016851) (← links)
- A graph approach to generate all possible regression submodels (Q1020883) (← links)
- A tutorial on geometric programming (Q1027158) (← links)
- Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
- AND/OR branch-and-bound search for combinatorial optimization in graphical models (Q1045990) (← links)
- Mixed linear system estimation and identification (Q1046675) (← links)
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm (Q1068720) (← links)
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (Q1121783) (← links)
- Branch \& Sample: A simple strategy for constraint satisfaction (Q1123646) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- Probabilistic analysis of solving the assignment problem for the traveling salesman problem (Q1158107) (← links)
- Algorithms for parametric nonconvex programming (Q1158344) (← links)
- An effective structured approach to finding optimal partitions of networks (Q1164549) (← links)
- Branch-and-bound as a higher-order function (Q1179748) (← links)
- On the complexity of admissible search algorithms (Q1232903) (← links)
- An analysis of alpha-beta pruning (Q1238442) (← links)
- A language and a program for stating and solving combinatorial problems (Q1245009) (← links)
- Branching from the largest upper bound. Folklore and facts (Q1247917) (← links)
- An approach for solving a class of transportation scheduling problems (Q1251987) (← links)
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems (Q1310005) (← links)
- An improved branch and bound algorithm for mixed integer nonlinear programs (Q1318452) (← links)
- A new node selection strategy in the branch-and-bound procedure (Q1342946) (← links)
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problem (Q1362516) (← links)
- A binary integer linear program with multi-criteria and multi-constraint levels (Q1373885) (← links)
- A note on the complexity of the asymmetric traveling salesman problem (Q1374382) (← links)
- A hybrid approach to resolving a differentiable integer program. (Q1406652) (← links)
- Nurse rostering problems -- a bibliographic survey. (Q1410304) (← links)
- Nagging: A scalable fault-tolerant paradigm for distributed search (Q1614863) (← links)
- Truck routing and scheduling (Q1642792) (← links)
