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.
- Optimal Rerandomization via a Criterion that Provides Insurance Against Failed Experiments (Q130860) (← links)
- A cutting plane method for solving harvest scheduling models with area restrictions (Q257266) (← links)
- A fixed point iterative approach to integer programming and its distributed computation (Q288180) (← links)
- Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem (Q322545) (← links)
- Discrete-continuous optimization of heat network operating conditions in parallel operation of similar pumps at pumping stations (Q330506) (← links)
- Ordered spatial sampling by means of the traveling salesman problem (Q333365) (← links)
- A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
- Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples (Q373884) (← links)
- Choosing optimal road trajectory with random work cost in different areas (Q384698) (← links)
- A greedy algorithm for combined scheduling of computations and data exchanges in real-time systems (Q395472) (← links)
- Computing the lowest equilibrium pose of a cable-suspended rigid body (Q402228) (← links)
- Globally optimal algorithms for stratified autocalibration (Q408824) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- On efficient calculations for Bayesian variable selection (Q434881) (← links)
- More power via graph-structured tests for differential expression of gene networks (Q439146) (← links)
- Internet shopping with price sensitive discounts (Q457290) (← links)
- Energy-optimal multi-goal motion planning for planar robot manipulators (Q467470) (← links)
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming (Q486413) (← links)
- On the path-width of integer linear programming (Q515665) (← links)
- Mixed integer programming: A historical perspective with Xpress-MP (Q537574) (← links)
- Branch and bound, integer, and non-integer programming (Q537592) (← links)
- A survey of the operational use of ILP models (Q537604) (← links)
- Broadening the integer programming audience, the LINDO perspective (Q537610) (← links)
- IP over 40+ years at IBM scientific centers and marketing (Q537612) (← links)
- Optimizing planned maintenance graphs for collections of engineering network sections (Q544682) (← links)
- Uniform tree approximation by global optimization techniques (Q600944) (← links)
- Redundant modeling in permutation weighted constraint satisfaction problems (Q606896) (← links)
- Study of multiscale global optimization based on parameter space partition (Q620530) (← links)
- A fast tour design method using non-tangent V-infinity leveraging transfer (Q642387) (← links)
- Mathematical model for cyclic scheduling with work-in-process minimization (Q656064) (← links)
- Stabilization of polytopic delay difference inclusions via the razumikhin approach (Q665174) (← links)
- Polynomial-time approximation algorithms for anchor-free TDoA localization (Q742410) (← links)
- SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications (Q743971) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- Dominating communities for hierarchical control of complex networks (Q778406) (← links)
- An implicit branch-and-bound algorithm for mixed-integer linear programming (Q804472) (← links)
- Coal blending -- with acceptance sampling (Q807402) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- Logical processing for integer programming (Q817209) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- On the pseudo-periodicity of the integer hull of parametric convex polygons (Q831988) (← links)
- A partial enumeration algorithm for pure nonlinear integer programming (Q838194) (← links)
- Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results (Q849084) (← links)
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332) (← links)
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures (Q862395) (← links)
- An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane (Q870164) (← links)
