Pages that link to "Item:Q3284268"
From MaRDI portal
The following pages link to An Automatic Method of Solving Discrete Programming Problems (Q3284268):
Displaying 50 items.
- An exact method for partitioning dichotomous items within the framework of the monotone homogeneity model (Q906046) (← links)
- A Branch and Price algorithm for the \(k\)-splittable maximum flow problem (Q937408) (← links)
- Stochastic level-value approximation for quadratic integer convex programming (Q940660) (← links)
- A large neighborhood search heuristic for the longest common subsequence problem (Q953288) (← links)
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305) (← links)
- An improved partial enumeration algorithm for integer programming problems (Q1026562) (← links)
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
- Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis (Q1048653) (← links)
- GENFOLD 2: A set of models and algorithms for the GENeral unFOLDing analysis of preference/dominance data (Q1057601) (← links)
- Principal direction search: A new method of search for unconstrained LP formulations (Q1058964) (← links)
- A branch and bound algorithm for extreme point mathematical programming problems (Q1078072) (← links)
- Optimizing the number of tools and cutting parameters in multi-tool turning for multiple objectives through geometric programming (Q1084011) (← links)
- Solution approaches for highly primal- and dual-degenerate all-integer programming problems (Q1085064) (← links)
- Some branch and bound techniques for nonlinear optimization (Q1100098) (← links)
- Partitioning procedures for solving mixed-variables programming problems (Q1131201) (← links)
- A branch and bound algorithm with constraint partitioning for integer goal programming problems (Q1141085) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- Branch-and-bound as a higher-order function (Q1179748) (← links)
- Unified theory of automation in process planning utilizing multiobjectives under real world constraints (Q1193140) (← links)
- An approximate method for local optima for nonlinear mixed integer programming problems (Q1200840) (← links)
- An intelligent algorithm for mixed-integer programming models (Q1206379) (← links)
- Algorithmus 25. Verfahren zur gemischt-ganzzahligen konvexen Optimierung (Q1217451) (← links)
- A language and a program for stating and solving combinatorial problems (Q1245009) (← links)
- An implicit enumeration algorithm for the all integer programming problem (Q1245147) (← links)
- Solving a two-dimensional trim-loss with MILP (Q1291689) (← links)
- An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem (Q1291694) (← links)
- Different transformations for solving non-convex trim-loss problems by MINLP (Q1291782) (← links)
- A new node selection strategy in the branch-and-bound procedure (Q1342946) (← links)
- A binary integer linear program with multi-criteria and multi-constraint levels (Q1373885) (← links)
- A hybrid approach to resolving a differentiable integer program. (Q1406652) (← links)
- A two-phase optimization procedure for integer programming problems (Q1609029) (← links)
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
- A new procedure for solving integer linear programming problems (Q1639913) (← links)
- The UMP exact test and the confidence interval for person parameters in IRT models (Q1643442) (← links)
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
- An abstract model for branching and its application to mixed integer programming (Q1683695) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Dispersion with connectivity in wireless mesh networks (Q1716989) (← links)
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems (Q1732230) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Fathoming rules for biobjective mixed integer linear programs: review and extensions (Q1751199) (← links)
- A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables (Q1753593) (← links)
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (Q1756762) (← links)
- A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
- Optimal decision trees for feature based parameter tuning: integer programming model and VNS heuristic (Q1791966) (← links)
- An optimal control approach to nonlinear mixed integer programming problems (Q1806583) (← links)
- A continuous approach to nonlinear integer programming (Q1824556) (← links)
- An algebra-based approach for linearly constrained concave minimization (Q1876470) (← links)
- A local relaxation method for the cardinality constrained portfolio optimization problem (Q1935581) (← links)
- Exact group sequential methods for estimating a binomial proportion (Q1952476) (← links)
