An Automatic Method of Solving Discrete Programming Problems

Cited in

(only showing first 100 items - show all)

An improved partial enumeration algorithm for integer programming problems
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
A branch and bound algorithm for extreme point mathematical programming problems
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
Some branch and bound techniques for nonlinear optimization
Partitioning procedures for solving mixed-variables programming problems
A branch and bound algorithm with constraint partitioning for integer goal programming problems
Heuristics and their design: A survey
Branch-and-bound as a higher-order function
Unified theory of automation in process planning utilizing multiobjectives under real world constraints
An approximate method for local optima for nonlinear mixed integer programming problems
An intelligent algorithm for mixed-integer programming models
Algorithmus 25. Verfahren zur gemischt-ganzzahligen konvexen Optimierung
A language and a program for stating and solving combinatorial problems
An implicit enumeration algorithm for the all integer programming problem
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
Optimal rerandomization designs via a criterion that provides insurance against failed experiments
A new node selection strategy in the branch-and-bound procedure
A binary integer linear program with multi-criteria and multi-constraint levels
A hybrid approach to resolving a differentiable integer program.
A two-phase optimization procedure for integer programming problems
A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
A new procedure for solving integer linear programming problems
The UMP exact test and the confidence interval for person parameters in IRT models
Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
An abstract model for branching and its application to mixed integer programming
Domain reduction techniques for global NLP and MINLP optimization
Dispersion with connectivity in wireless mesh networks
On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
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
On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
A computational study of the permutation flow shop problem based on a tight lower bound
Optimal decision trees for feature based parameter tuning: integer programming model and VNS heuristic
An optimal control approach to nonlinear mixed integer programming problems
A continuous approach to nonlinear integer programming
An algebra-based approach for linearly constrained concave minimization
A local relaxation method for the cardinality constrained portfolio optimization problem
Exact group sequential methods for estimating a binomial proportion
Power-to-chemicals: a superstructure problem for sustainable syngas production
Multilayer tensor factorization with applications to recommender systems
Experiments with conflict analysis in mixed integer programming
The traveling salesman game for cost allocation: the case study of the bus service in Castellanza
Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search
Some new perspectives for solving 0--1 integer programming problems using balas method
MAP inference via _2-sphere linear program reformulation
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
Computing in combinatorial optimization
Lower bound on size of branch-and-bound trees for solving lot-sizing problem
Worst-case analysis of clique MIPs
TCMI: a non-parametric mutual-dependence estimator for multivariate continuous distributions
Computing the integer hull of convex polyhedral sets
An algorithm-independent measure of progress for linear constraint propagation
Adaptive large neighborhood search for mixed integer programming
An abstract model for branch-and-cut
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
A new method of finding component orthogonal arrays for order-of-addition experiments
Further results on an abstract model for branching and its application to mixed integer programming
Obituary: Ailsa H. Land, EURO Gold Medallist (1927--2021)
Ising formulations of some graph-theoretic problems in psychological research: models and methods
Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method
QPLIB: a library of quadratic programming instances
Certifiably optimal sparse principal component analysis
Structure-driven fix-and-propagate heuristics for mixed integer programming
Feasibility pump algorithm for sparse representation under Laplacian noise
Optimally configuring a measurement system to detect diversions from a nuclear fuel cycle
POD-based mixed-integer optimal control of the heat equation
Mathematical modeling and optimal blank generation in glass manufacturing
A combinatorial branch-and-bound algorithm for box search
Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
Redundant robust topology optimization of truss
Three ideas for a feasibility pump for nonconvex MINLP
An efficient envelope-based branch and bound algorithm for non-convex combined heat and power production planning
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
On learning and branching: a survey
Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
Maximum-likelihood detection based on branch and bound algorithm for MIMO systems
A taxonomy of exact methods for partial Max-SAT
Undercover: a primal MINLP heuristic exploring a largest sub-MIP
Solving 0-1 programming problems by a penalty approach.
Integer solutions via goal programming to hierarchical systems.
Predatory search algorithm with restriction of solution distance
A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs
Solving convex MINLP optimization problems using a sequential cutting plane algorithm
Improving strong branching by domain propagation

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)