Experiments in mixed-integer linear programming
From MaRDI portal
Publication:5642449
DOI10.1007/BF01584074zbMath0233.90016OpenAlexW1999049191MaRDI QIDQ5642449
P. Girodet, Gerard Ribiere, M. Benichou, G. Hentges, O. Vincent, J.-M. Gauthier
Publication date: 1971
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584074
Related Items
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Disjunctive Cuts for Nonconvex MINLP, Branching rules revisited, Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems, Adaptive large neighborhood search for mixed integer programming, A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems, Achieving MILP feasibility quickly using general disjunctions, Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information, Transferring information across restarts in MIP, Multivariable Branching: A 0-1 Knapsack Problem Case Study, COVID-19: metaheuristic optimization-based forecast method on time-dependent bootstrapped data, On learning and branching: a survey, Decomposition Branching for Mixed Integer Programming, Computational study of a branching algorithm for the maximum \(k\)-cut problem, A theoretical and computational analysis of full strong-branching, Information-theoretic approaches to branching in search, The leave-worst-\(k\)-out criterion for cross validation, Branching on nonchimerical fractionalities, Investigation of some branch and bound strategies for the solution of mixed integer linear programs, Optimization Bounds from the Branching Dual, Improved penalty calculations for a mixed integer branch-and-bound algorithm, From feasibility to improvement to proof: three phases of solving mixed-integer programs, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, Further results on an abstract model for branching and its application to mixed integer programming, Backdoor Branching, An algorithmic framework for convex mixed integer nonlinear programs, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Experiments with conflict analysis in mixed integer programming, Experiments in mixed-integer linear programming using pseudo-costs, Information-based branching schemes for binary linear mixed integer problems, Evaluating the impact of AND/OR search on 0-1 integer linear programming, A computational study of parametric tabu search for 0-1 mixed integer programs, Faster MIP solutions via new node selection rules, Active-constraint variable ordering for faster feasibility of mixed integer linear programs, The stochastic transportation problem with single sourcing, Measuring the Impact of Branching Rules for Mixed-Integer Programming, Solving convex MINLP optimization problems using a sequential cutting plane algorithm, Solving linear programs with complementarity constraints using branch-and-cut, The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results, Branching from the largest upper bound. Folklore and facts, Improving strong branching by domain propagation, SCIP: solving constraint integer programs, Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange, Unnamed Item, A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem, Analisis de estrategias en el ajuste lineal de funciones no-lineales en problemas de optimizacion, Theoretical comparisons of search strategies in branch-and-bound algorithms, A continuous approach to nonlinear integer programming, Toward unification of exact and heuristic optimization methods, A combinatorial branch-and-bound algorithm for box search, Solving large-scale mixed-integer programs with fixed charge variables, Trivial integer programs unsolvable by branch-and-bound, On generalized surrogate duality in mixed-integer nonlinear programming, Integer-programming software systems
Cites Work
