The following pages link to Branching rules revisited (Q1886796):
Displaying 50 items.
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- Extended reverse-convex programming: an approximate enumeration approach to global optimization (Q288222) (← links)
- A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes (Q319637) (← links)
- DASH: dynamic approach for switching heuristics (Q320816) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Global optima for the Zhou-Rozvany problem (Q381557) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644) (← links)
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach (Q411431) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- Branching on nonchimerical fractionalities (Q439902) (← links)
- Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control (Q467420) (← links)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- Nurse rostering at a Danish ward (Q490204) (← links)
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
- Branching on general disjunctions (Q543420) (← links)
- Orbital branching (Q623461) (← links)
- Faster integer-feasibility in mixed-integer linear programs by branching to force change (Q632648) (← links)
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- Exact solution approaches for the multi-period degree constrained minimum spanning tree problem (Q724056) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach (Q958447) (← links)
- A branching scheme for finding cost-minimal round robin tournaments (Q1011262) (← links)
- A bi-objective approach to discrete cost-bottleneck location problems (Q1615950) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623) (← links)
- Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem (Q1651640) (← links)
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
- Redundancy system design for an aircraft door management system (Q1652598) (← links)
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
- Thinner is not always better: cascade knapsack problems (Q1727953) (← links)
- The sport teams grouping problem (Q1730756) (← links)
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
- A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design (Q1744533) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports (Q1751727) (← links)
- Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
- How important are branching decisions: fooling MIP solvers (Q1785358) (← links)
- Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
