An Automatic Method of Solving Discrete Programming Problems

DOI10.2307/1910129zbMath0101.37004OpenAlexW4240374930WikidataQ55934470 ScholiaQ55934470MaRDI QIDQ3284268

Ailsa Land, Alison Harcourt

Publication date: 1960

Published in: Econometrica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1910129

zbMATH Keywords

applications of probability theory and statistics

Related Items (only showing first 100 items - show all)

Redundant robust topology optimization of truss ⋮ Three ideas for a feasibility pump for nonconvex MINLP ⋮ Rückgerechnete Duale Variable ⋮ Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben ⋮ An efficient envelope-based branch and bound algorithm for non-convex combined heat and power production planning ⋮ Algorithms and Software for Convex Mixed Integer Nonlinear Programs ⋮ Algorithms for single-machine scheduling problem with deterioration depending on a novel model ⋮ The Boolean Quadric Polytope ⋮ Harmonizing Optimized Designs With Classic Randomization in Experiments ⋮ Adaptive large neighborhood search for mixed integer programming ⋮ On estimating workload in interval branch-and-bound global optimization algorithms ⋮ Bound reduction using pairs of linear inequalities ⋮ Deterministic global optimization in ab-initio quantum chemistry ⋮ Mixed integer nonlinear programming tools: an updated practical overview ⋮ Iterative MC-algorithm to solve the global optimization problems ⋮ An abstract model for branch-and-cut ⋮ Ein kapazitiver enumerationsalgorithmus für lineare opti- mierungsprobleme mit ganzzahligkeitsbedingungen ⋮ Multivariable Branching: A 0-1 Knapsack Problem Case Study ⋮ Estimating the Size of Branch-and-Bound Trees ⋮ On learning and branching: a survey ⋮ Decomposition Branching for Mixed Integer Programming ⋮ Parallelization of the FICO Xpress-Optimizer ⋮ Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs ⋮ A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints ⋮ Maximum-likelihood detection based on branch and bound algorithm for MIMO systems ⋮ Achieving consistency with cutting planes ⋮ Lower bounds on the size of general branch-and-bound trees ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ Theory and methods of Euclidian combinatorial optimization: current status and prospects ⋮ An exploratory computational analysis of dual degeneracy in mixed-integer programming ⋮ Discrete-time MPC for switched systems with applications to biomedical problems ⋮ A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation ⋮ Undercover: a primal MINLP heuristic exploring a largest sub-MIP ⋮ Models and methods of solution of quadratic integer programming problems ⋮ Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds ⋮ A new method of finding component orthogonal arrays for order-of-addition experiments ⋮ 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 ⋮ A framework for solving mixed-integer semidefinite programs ⋮ Power-to-chemicals: a superstructure problem for sustainable syngas production ⋮ Further results on an abstract model for branching and its application to mixed integer programming ⋮ Approximate and exact merging of knapsack constraints with cover inequalities ⋮ Um modelo híbrido (CLP-MILP) para scheduling de operações em polidutos ⋮ Obituary: Ailsa H. Land, EURO Gold Medallist (1927--2021) ⋮ Mixed-Integer Programming for Cycle Detection in Nonreversible Markov Processes ⋮ Solving 0-1 programming problems by a penalty approach. ⋮ Integer solutions via goal programming to hierarchical systems. ⋮ Ising formulations of some graph-theoretic problems in psychological research: models and methods ⋮ Multilayer tensor factorization with applications to recommender systems ⋮ Unnamed Item ⋮ Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick) ⋮ Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization ⋮ Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method ⋮ Experiments with conflict analysis in mixed integer programming ⋮ Experiments in mixed-integer linear programming using pseudo-costs ⋮ The traveling salesman game for cost allocation: the case study of the bus service in Castellanza ⋮ The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization ⋮ A hybrid algorithm for the generalized assignment problem ⋮ Predatory search algorithm with restriction of solution distance ⋮ A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs ⋮ Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search ⋮ Preprocessing composite cutting procedure: an approach to the integer model ⋮ Measuring the Impact of Branching Rules for Mixed-Integer Programming ⋮ Solving convex MINLP optimization problems using a sequential cutting plane algorithm ⋮ QPLIB: a library of quadratic programming instances ⋮ Improving strong branching by domain propagation ⋮ Least Squares Sparse Principal Component Analysis: A Backward Elimination Approach to Attain Large Loadings ⋮ Certifiably optimal sparse principal component analysis ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Structure-driven fix-and-propagate heuristics for mixed integer programming ⋮ Feasibility pump algorithm for sparse representation under Laplacian noise ⋮ Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm ⋮ Discrete search and the Neyman-Pearson lemma ⋮ Some new perspectives for solving 0--1 integer programming problems using balas method ⋮ Parallelization of the FICO Xpress-Optimizer ⋮ MAP inference via \(\ell_2\)-sphere linear program reformulation ⋮ Optimizing Execution Cost Using Stochastic Control ⋮ 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 ⋮ Unnamed Item ⋮ Computing in combinatorial optimization ⋮ A self-adaptive biogeography-based algorithm to solve the set covering problem ⋮ Conflict Analysis for MINLP ⋮ Conflict-Driven Heuristics for Mixed Integer Programming ⋮ Optimally configuring a measurement system to detect diversions from a nuclear fuel cycle ⋮ Lower bound on size of branch-and-bound trees for solving lot-sizing problem ⋮ Unnamed Item ⋮ POD-based mixed-integer optimal control of the heat equation ⋮ Worst-case analysis of clique MIPs ⋮ Median Problems in Networks ⋮ Exact Solution of Two Location Problems via Branch-and-Bound ⋮ Mathematical modeling and optimal blank generation in glass manufacturing ⋮ A combinatorial branch-and-bound algorithm for box search ⋮ TCMI: a non-parametric mutual-dependence estimator for multivariate continuous distributions ⋮ Computing the integer hull of convex polyhedral sets ⋮ Trivial integer programs unsolvable by branch-and-bound ⋮ An algorithm-independent measure of progress for linear constraint propagation ⋮ A primal-like algorithm for zero-one integer Fractional Programming Problem ⋮ Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm ⋮ On integer solutions to quadratic programs by a branch and bound technique

This page was built for publication: An Automatic Method of Solving Discrete Programming Problems