An Automatic Method of Solving Discrete Programming Problems
From MaRDI portal
Publication:3284268
DOI10.2307/1910129zbMath0101.37004OpenAlexW4240374930WikidataQ55934470 ScholiaQ55934470MaRDI QIDQ3284268
Publication date: 1960
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1910129
Related Items
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, A branch and bound algorithm for extreme point mathematical programming problems, An algebra-based approach for linearly constrained concave minimization, Minotaur: a mixed-integer nonlinear optimization toolkit, Optimizing the number of tools and cutting parameters in multi-tool turning for multiple objectives through geometric programming, Solution approaches for highly primal- and dual-degenerate all-integer programming problems, A fixed point iterative approach to integer programming and its distributed computation, On the pseudo-periodicity of the integer hull of parametric convex polygons, A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach, A partial enumeration algorithm for pure nonlinear integer programming, A new node selection strategy in the branch-and-bound procedure, A new procedure for solving integer linear programming problems, Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results, Some branch and bound techniques for nonlinear optimization, The UMP exact test and the confidence interval for person parameters in IRT models, Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem, Discrete-continuous optimization of heat network operating conditions in parallel operation of similar pumps at pumping stations, Ordered spatial sampling by means of the traveling salesman problem, A branch-and-bound algorithm for the acyclic partitioning problem, Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem, Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information, M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures, An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane, A binary integer linear program with multi-criteria and multi-constraint levels, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, Uniform tree approximation by global optimization techniques, Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples, Redundant modeling in permutation weighted constraint satisfaction problems, Choosing optimal road trajectory with random work cost in different areas, Partitioning procedures for solving mixed-variables programming problems, An abstract model for branching and its application to mixed integer programming, A greedy algorithm for combined scheduling of computations and data exchanges in real-time systems, Computing the lowest equilibrium pose of a cable-suspended rigid body, A local relaxation method for the cardinality constrained portfolio optimization problem, Study of multiscale global optimization based on parameter space partition, A branch and bound algorithm with constraint partitioning for integer goal programming problems, Globally optimal algorithms for stratified autocalibration, Dominance rules in combinatorial optimization problems, A hybrid approach to resolving a differentiable integer program., Domain reduction techniques for global NLP and MINLP optimization, An exact method for partitioning dichotomous items within the framework of the monotone homogeneity model, Heuristics and their design: A survey, On efficient calculations for Bayesian variable selection, More power via graph-structured tests for differential expression of gene networks, Exact group sequential methods for estimating a binomial proportion, A fast tour design method using non-tangent V-infinity leveraging transfer, Internet shopping with price sensitive discounts, Dispersion with connectivity in wireless mesh networks, Energy-optimal multi-goal motion planning for planar robot manipulators, Mathematical model for cyclic scheduling with work-in-process minimization, On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems, Branch-and-bound as a higher-order function, Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming, Stabilization of polytopic delay difference inclusions via the razumikhin approach, A Branch and Price algorithm for the \(k\)-splittable maximum flow problem, Stochastic level-value approximation for quadratic integer convex programming, Unified theory of automation in process planning utilizing multiobjectives under real world constraints, A large neighborhood search heuristic for the longest common subsequence problem, On the path-width of integer linear programming, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Fathoming rules for biobjective mixed integer linear programs: review and extensions, A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables, An approximate method for local optima for nonlinear mixed integer programming problems, On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation, An intelligent algorithm for mixed-integer programming models, Mixed integer programming: A historical perspective with Xpress-MP, Branch and bound, integer, and non-integer programming, A survey of the operational use of ILP models, Broadening the integer programming audience, the LINDO perspective, IP over 40+ years at IBM scientific centers and marketing, Optimizing planned maintenance graphs for collections of engineering network sections, Algorithmus 25. Verfahren zur gemischt-ganzzahligen konvexen Optimierung, A computational study of the permutation flow shop problem based on a tight lower bound, Active-constraint variable ordering for faster feasibility of mixed integer linear programs, A language and a program for stating and solving combinatorial problems, An implicit enumeration algorithm for the all integer programming problem, Optimal decision trees for feature based parameter tuning: integer programming model and VNS heuristic, Optimal Rerandomization via a Criterion that Provides Insurance Against Failed Experiments, Polynomial-time approximation algorithms for anchor-free TDoA localization, SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications, RENS. The optimal rounding, An optimal control approach to nonlinear mixed integer programming problems, An exact combinatorial algorithm for minimum graph bisection, A bounded-error quantum polynomial-time algorithm for two graph bisection problems, An improved partial enumeration algorithm for integer programming problems, A continuous approach to nonlinear integer programming, Mixed integer nonlinear programming tools: a practical overview, Dominating communities for hierarchical control of complex networks, Solving a two-dimensional trim-loss with MILP, An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem, Different transformations for solving non-convex trim-loss problems by MINLP, Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms, Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis, GENFOLD 2: A set of models and algorithms for the GENeral unFOLDing analysis of preference/dominance data, Principal direction search: A new method of search for unconstrained LP formulations, An implicit branch-and-bound algorithm for mixed-integer linear programming, Coal blending -- with acceptance sampling, A two-phase optimization procedure for integer programming problems, A cutting plane method for solving harvest scheduling models with area restrictions, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems, Logical processing for integer programming, COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, A branch‐bound algorithm for the capacitated facilities location problem, Two algorithms for a plant-storehouse location problem, The minimal cost maximum matching of a graph, Experiments in mixed-integer linear programming, ILP-Based Local Search for Graph Partitioning, Branch-and-bound solves random binary IPs in poly\((n)\)-time, A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems, Anti-Ramsey problems in the Mycielskian of a cycle, Closed Testing with Globaltest, with Application in Metabolomics, Online learning for scheduling MIP heuristics, Automatic generation of dominance breaking nogoods for a class of constraint optimization problems, Experiments with automated reasoning in the class, Foundations of operations research: from linear programming to data envelopment analysis, Sensitivity analysis of combinatorial optimization problems using evolutionary bilevel optimization and data mining, A survey on mixed-integer programming techniques in bilevel optimization, 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., An integer linear programming model for tilings, Some contributions of Ailsa H. Land to the study of the traveling salesman problem, Multi-period liability clearing via convex optimal control, A branch and bound algorithm for robust binary optimization with budget uncertainty, Comparison of parallel implementations of the branch-and-bound method for shared memory systems, Les procedures arborescentes d’optimisation, Enumerative inequalities in integer programming, A direct search method for the integer solution of the two-machine loading problem, Classical cuts for mixed-integer programming and branch-and-cut, An exact algorithm for the two-mode \(KL\)-means partitioning problem, Preface, A genetic algorithm applied to optimal allocation in stratified sampling
