Pages that link to "Item:Q4427374"
From MaRDI portal
The following pages link to A Computational Study of Search Strategies for Mixed Integer Programming (Q4427374):
Displaying 50 items.
- Learning Certifiably Optimal Rule Lists for Categorical Data (Q115375) (← links)
- A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes (Q319637) (← links)
- A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
- Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
- DASH: dynamic approach for switching heuristics (Q320816) (← links)
- Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← 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)
- 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)
- Branching on general disjunctions (Q543420) (← links)
- Orbital branching (Q623461) (← links)
- A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound (Q707082) (← links)
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- On a fix-and-relax framework for a class of project scheduling problems (Q817205) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- A partial enumeration algorithm for pure nonlinear integer programming (Q838194) (← links)
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems (Q839891) (← links)
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332) (← 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)
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← links)
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances (Q969755) (← links)
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305) (← links)
- An improved partial enumeration algorithm for integer programming problems (Q1026562) (← links)
- Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version (Q1040964) (← links)
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. (Q1410308) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- Combinatorial optimization: current successes and directions for the future (Q1593834) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
- Full-shipload tramp ship routing and scheduling with variable speeds (Q1651617) (← 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)
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940) (← links)
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints (Q1774170) (← links)
- Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
- Branching rules revisited (Q1886796) (← links)
- An exact penalty function method for nonlinear mixed discrete programming problems (Q1936789) (← links)
- Experiments with conflict analysis in mixed integer programming (Q2011593) (← links)
- Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search (Q2026990) (← links)
- Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances (Q2076814) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (Q2140266) (← links)
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm (Q2176276) (← links)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- Faster MIP solutions via new node selection rules (Q2270439) (← links)
