A tree-search algorithm for mixed integer programming problems
From MaRDI portal
Publication:5535433
DOI10.1093/comjnl/8.3.250zbMath0154.42004OpenAlexW2033735555MaRDI QIDQ5535433
Publication date: 1965
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/8.3.250
Related Items
Handling symmetries in mixed-integer semidefinite programs, Fill‐rate service level constrained distribution network design, A theoretical and computational analysis of full strong-branching, Résolution des programmes linéaires a variables mixtes par la procédure S.E.P., Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming, Les procedures arborescentes d’optimisation, The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming, Redundant robust topology optimization of truss, Optimal distributed execution of join queries, Minotaur: a mixed-integer nonlinear optimization toolkit, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, Zur kepplimg eines exakten verfahrens mit einem heuristiscieb verfahren für die lösung ganzzahliger linearer optimierungsprobleme, Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben, Inversion of convection-diffusion equation with discrete sources, Solution approaches for highly primal- and dual-degenerate all-integer programming problems, Incorporating processor costs in optimizing the distributed execution of join queries, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Algorithms for single-machine scheduling problem with deterioration depending on a novel model, Solving disjunctive optimization problems by generalized semi-infinite optimization techniques, Adaptive large neighborhood search for mixed integer programming, Finding multiple solutions to general integer linear programs, Executing join queries in an uncertain distributed environment, Cutting Plane Algorithm for Convex Generalized Disjunctive Programs, Allocating relations in a distributed database system, Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information, Mixed integer nonlinear programming tools: an updated practical overview, The supporting hyperplane optimization toolkit for convex MINLP, The propagation of updates to relational tables in a distributed database system, A binary integer linear program with multi-criteria and multi-constraint levels, The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming, Estimating the Size of Branch-and-Bound Trees, Modeling without categorical variables: a mixed-integer nonlinear program for the optimization of thermal insulation systems, Probabilistic partial set covering problems, Some mathematical aspects of price optimisation, Experiments in mixed-integer linear programming, A partial outer convexification approach to control transmission lines, A multicriteria approach to the location of public facilities, A local relaxation method for the cardinality constrained portfolio optimization problem, A branch and bound algorithm with constraint partitioning for integer goal programming problems, Heuristics and their design: A survey, Hidden genes genetic optimization for variable-size design space problems, A trajectory-based method for mixed integer nonlinear programming problems, Parametric integer linear programming: A synthesis of branch and bound with cutting planes, Optimal progressive group-censoring plans for exponential distribution in presence of cost constraint, A branch and bound algorithm for the generalized assignment problem, Mixed-integer nonlinear programs featuring ``on/off constraints, Two-stage stratified randomized response model with fuzzy numbers, An exploratory computational analysis of dual degeneracy in mixed-integer programming, Energy-optimal multi-goal motion planning for planar robot manipulators, Models and methods of solution of quadratic integer programming problems, Branch-and-bound as a higher-order function, A Branch and Price algorithm for the \(k\)-splittable maximum flow problem, Stochastic level-value approximation for quadratic integer convex programming, From feasibility to improvement to proof: three phases of solving mixed-integer programs, A framework for solving mixed-integer semidefinite programs, Mixed-Integer Programming for Cycle Detection in Nonreversible Markov Processes, On a class of assignment problems., Integer solutions via goal programming to hierarchical systems., DISOPT—A general programme for continuous and discrete non-linear programming problems†, Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation, An approximate method for local optima for nonlinear mixed integer programming problems, Unnamed Item, Selection of parts and machines for cellularization: A mathematical programming approach, An intelligent algorithm for mixed-integer programming models, Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick), Computer-based algorithms for multiple criteria and multiple constraint level integer linear programming, Experiments with conflict analysis in mixed integer programming, Algorithmus 25. Verfahren zur gemischt-ganzzahligen konvexen Optimierung, Experiments in mixed-integer linear programming using pseudo-costs, Polyhedral annexation in mixed integer and combinatorial programming, Optimization of electrical circuits, Faster MIP solutions via new node selection rules, A hybrid algorithm for the generalized assignment problem, Active-constraint variable ordering for faster feasibility of mixed integer linear programs, The use of relaxation techniques to solve certain mathematical decision‐making problems, Reformulations for utilizing separability when solving convex MINLP problems, Preprocessing composite cutting procedure: an approach to the integer model, Solving convex MINLP optimization problems using a sequential cutting plane algorithm, QPLIB: a library of quadratic programming instances, Improving strong branching by domain propagation, Structure-driven fix-and-propagate heuristics for mixed integer programming, Polynomial-time approximation algorithms for anchor-free TDoA localization, Evaluating multiple join queries in a distributed database system, Using regularization and second order information in outer approximation for convex MINLP, Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm, Column-Generation in Integer Linear Programming, Computational aspects of infeasibility analysis in mixed integer programming, Ordering policies of a deteriorating item in an EOQ model under upstream partial order-quantity-dependent trade credit and downstream full trade credit, Integer programming duality: Price functions and sensitivity analysis, Global hybrid modeling and control of a buck converter: A novel concept, Mixed integer nonlinear programming tools: a practical overview, Conflict Analysis for MINLP, Conflict-Driven Heuristics for Mixed Integer Programming, A linear programming-based optimization algorithm for solving nonlinear programming problems, Alternative regularizations for outer-approximation algorithms for convex MINLP, Implementations of special ordered sets in MP software, The transportation problem with exclusionary side constraints and two branch-and-bound algorithms, GENFOLD 2: A set of models and algorithms for the GENeral unFOLDing analysis of preference/dominance data, Sparse regression at scale: branch-and-bound rooted in first-order optimization, Design of cellular manufacturing systems, An implicit branch-and-bound algorithm for mixed-integer linear programming, Operational planning of district heating and cooling plants through genetic algorithms for mixed 0-1 linear programming, Die Lösung eines nichtlinearen Investitionsproblems mit Hilfe binärer Optimierungsalgorithmen — gezeigt am Beispiel der Planung regionaler Abwasserbehandlungssysteme, An interactive fuzzy satisficing method for general multiobjective 0-1 programming problems through genetic algorithms with double strings based on a reference solution, Trivial integer programs unsolvable by branch-and-bound, Genetic algorithms with double strings for 0-1 programming problems, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
