The following pages link to Branching rules revisited (Q1886796):
Displayed 30 items.
- 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)
- 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)
- SCIP: solving constraint integer programs (Q734351) (← 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)
- Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- A branch-and-cut algorithm for the Steiner tree problem with delays (Q1926621) (← links)
- A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- Faster MIP solutions via new node selection rules (Q2270439) (← links)
- Tolerance-based branch and bound algorithms for the ATSP (Q2482753) (← links)
- A new branch-and-price algorithm for the traveling tournament problem (Q2655609) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Optimization in Designing Complex Communication Networks (Q2913773) (← links)
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103) (← links)
- The vehicle routing problem with time windows and temporal dependencies (Q3113512) (← links)
- One-dimensional relaxations and LP bounds for orthogonal packing (Q3401330) (← links)
- Computing with Multi-row Gomory Cuts (Q3503849) (← links)
- Constraint Integer Programming: A New Approach to Integrate CP and MIP (Q5387617) (← links)