An Automatic Method of Solving Discrete Programming Problems

Cited in

(only showing first 100 items - show all)

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
Trivial integer programs unsolvable by branch-and-bound
An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane
Solving 0-1 programming problems by a penalty approach.
An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
Solving a two-dimensional trim-loss with MILP
Some contributions of Ailsa H. Land to the study of the traveling salesman problem
Multi-period liability clearing via convex optimal control
A combinatorial branch-and-bound algorithm for box search
Uniform tree approximation by global optimization techniques
COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
The UMP exact test and the confidence interval for person parameters in IRT models
Sequential Monte Carlo optimization and statistical inference
Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search
A combinatorial approach for small and strong formulations of disjunctive constraints
Different transformations for solving non-convex trim-loss problems by MINLP
Optimizing execution cost using stochastic control
Learning to branch: generalization guarantees and limits of data-independent discretization
Closed Testing with Globaltest, with Application in Metabolomics
Comparison of parallel implementations of the branch-and-bound method for shared memory systems
Redundant modeling in permutation weighted constraint satisfaction problems
A branch and bound algorithm for extreme point mathematical programming problems
Computing the integer hull of convex polyhedral sets
Preface
Foundations of operations research: from linear programming to data envelopment analysis
A self-adaptive biogeography-based algorithm to solve the set covering problem
Adaptive large neighborhood search for mixed integer programming
A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
Internet shopping with price sensitive discounts
A continuous approach to nonlinear integer programming
Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
A large neighborhood search heuristic for the longest common subsequence problem
A partial enumeration algorithm for pure nonlinear integer programming
50 years of mixed-integer nonlinear and disjunctive programming
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
Locally-averaged McCormick relaxations for discretization-regularized inverse problems
A bounded-error quantum polynomial-time algorithm for two graph bisection problems
Multivariable Branching: A 0-1 Knapsack Problem Case Study
scientific article; zbMATH DE number 7396890 (Why is no real title available?)
Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations
Mixed integer linear programming formulation techniques
A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
Approximate and exact merging of knapsack constraints with cover inequalities
Study of multiscale global optimization based on parameter space partition
An improved partial enumeration algorithm for integer programming problems
A local relaxation method for the cardinality constrained portfolio optimization problem
Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
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
Parallelization of the FICO Xpress-Optimizer
Theory and methods of Euclidian combinatorial optimization: current status and prospects
Some branch and bound techniques for nonlinear optimization
Integer programming in psychology: a review and directions for future research
Optimal decision trees for feature based parameter tuning: integer programming model and VNS heuristic
A language and a program for stating and solving combinatorial problems
A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs
Theory and methodology of time-dependent scheduling: past, present and future
Automatic generation of dominance breaking nogoods for a class of constraint optimization problems
RENS. The optimal rounding
Multiple testing of mix-and-match feature sets in multi-omics
Distributionally robust optimization of the vehicle routing problem with uncertain customers
An abstract model for branch-and-cut
An exact method for partitioning dichotomous items within the framework of the monotone homogeneity model
Branch-and-bound as a higher-order function
Some new perspectives for solving 0--1 integer programming problems using balas method
MAP inference via _2-sphere linear program reformulation
Predatory search algorithm with restriction of solution distance
Fathoming rules for biobjective mixed integer linear programs: review and extensions
A computational study of the permutation flow shop problem based on a tight lower bound
Analyzing the numerical correctness of branch-and-bound decisions for mixed-integer programming
Online learning for scheduling MIP heuristics
Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method
A branch‐bound algorithm for the capacitated facilities location problem
Models and methods of solution of quadratic integer programming problems
Experiments in mixed-integer linear programming
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
Dominance rules in combinatorial optimization problems
Algorithms and Software for Convex Mixed Integer Nonlinear Programs
On estimating workload in interval branch-and-bound global optimization algorithms
Deterministic global optimization in ab-initio quantum chemistry
Iterative MC-algorithm to solve the global optimization problems
An exact algorithm for the two-mode \(KL\)-means partitioning problem
Minotaur: a mixed-integer nonlinear optimization toolkit
Dominating communities for hierarchical control of complex networks
A branch and bound algorithm for robust binary optimization with budget uncertainty
Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
Harmonizing Optimized Designs With Classic Randomization in Experiments
Decomposition Branching for Mixed Integer Programming
A survey on mixed-integer programming techniques in bilevel optimization
Three ideas for a feasibility pump for nonconvex MINLP
Least squares sparse principal component analysis: a backward elimination approach to attain large loadings
An abstract model for branching and its application to mixed integer programming
Improving strong branching by domain propagation
An approximate method for local optima for nonlinear mixed integer programming problems
M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3284268)