Pages that link to "Item:Q5642449"
From MaRDI portal
The following pages link to Experiments in mixed-integer linear programming (Q5642449):
Displaying 50 items.
- Achieving MILP feasibility quickly using general disjunctions (Q336442) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- Branching on nonchimerical fractionalities (Q439902) (← links)
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Integer-programming software systems (Q817202) (← links)
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305) (← links)
- Branching from the largest upper bound. Folklore and facts (Q1247917) (← links)
- A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems (Q1255881) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← 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-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- A continuous approach to nonlinear integer programming (Q1824556) (← links)
- Branching rules revisited (Q1886796) (← links)
- Experiments with conflict analysis in mixed integer programming (Q2011593) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (Q2140266) (← links)
- Adaptive large neighborhood search for mixed integer programming (Q2146445) (← links)
- Transferring information across restarts in MIP (Q2170173) (← links)
- Further results on an abstract model for branching and its application to mixed integer programming (Q2235165) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- Evaluating the impact of AND/OR search on 0-1 integer linear programming (Q2267805) (← links)
- Faster MIP solutions via new node selection rules (Q2270439) (← links)
- The stochastic transportation problem with single sourcing (Q2275818) (← links)
- Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange (Q2289919) (← links)
- A combinatorial branch-and-bound algorithm for box search (Q2339825) (← links)
- On learning and branching: a survey (Q2408515) (← links)
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
- Improving strong branching by domain propagation (Q2513744) (← links)
- COVID-19: metaheuristic optimization-based forecast method on time-dependent bootstrapped data (Q2662186) (← links)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
- The leave-worst-\(k\)-out criterion for cross validation (Q2693781) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Backdoor Branching (Q3009762) (← links)
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)
- Solving large-scale mixed-integer programs with fixed charge variables (Q3680611) (← links)
- Analisis de estrategias en el ajuste lineal de funciones no-lineales en problemas de optimizacion (Q3901311) (← links)
- Improved penalty calculations for a mixed integer branch-and-bound algorithm (Q4079323) (← links)
- Experiments in mixed-integer linear programming using pseudo-costs (Q4136935) (← links)
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results (Q4165158) (← links)
- Theoretical comparisons of search strategies in branch-and-bound algorithms (Q4192964) (← links)
- (Q4577935) (← links)
- From feasibility to improvement to proof: three phases of solving mixed-integer programs (Q4637827) (← links)
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831) (← links)
- Measuring the Impact of Branching Rules for Mixed-Integer Programming (Q4685753) (← links)
- Trivial integer programs unsolvable by branch-and-bound (Q4770206) (← links)
