Pages that link to "Item:Q5535433"
From MaRDI portal
The following pages link to A tree-search algorithm for mixed integer programming problems (Q5535433):
Displaying 50 items.
- Adaptive large neighborhood search for mixed integer programming (Q2146445) (← links)
- The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (Q2173514) (← links)
- An exploratory computational analysis of dual degeneracy in mixed-integer programming (Q2219511) (← links)
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (Q2250087) (← links)
- Faster MIP solutions via new node selection rules (Q2270439) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- Using regularization and second order information in outer approximation for convex MINLP (Q2297649) (← links)
- Redundant robust topology optimization of truss (Q2357836) (← links)
- Finding multiple solutions to general integer linear programs (Q2384650) (← links)
- Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
- A partial outer convexification approach to control transmission lines (Q2419514) (← links)
- On a class of assignment problems. (Q2468576) (← links)
- Integer solutions via goal programming to hierarchical systems. (Q2468635) (← links)
- Computer-based algorithms for multiple criteria and multiple constraint level integer linear programming (Q2485519) (← links)
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
- Improving strong branching by domain propagation (Q2513744) (← links)
- Algorithms for single-machine scheduling problem with deterioration depending on a novel model (Q2628177) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Cutting Plane Algorithm for Convex Generalized Disjunctive Programs (Q3186647) (← links)
- A hybrid algorithm for the generalized assignment problem (Q3348709) (← links)
- Global hybrid modeling and control of a buck converter: A novel concept (Q3401310) (← links)
- Preprocessing composite cutting procedure: an approach to the integer model (Q3604028) (← links)
- Zur kepplimg eines exakten verfahrens mit einem heuristiscieb verfahren für die lösung ganzzahliger linearer optimierungsprobleme (Q3703655) (← links)
- Models and methods of solution of quadratic integer programming problems (Q3807880) (← links)
- Optimization of electrical circuits (Q3858061) (← links)
- The use of relaxation techniques to solve certain mathematical decision‐making problems (Q3865861) (← links)
- Integer programming duality: Price functions and sensitivity analysis (Q3908768) (← links)
- A branch and bound algorithm for the generalized assignment problem (Q4066849) (← links)
- DISOPT—A general programme for continuous and discrete non-linear programming problems† (Q4110816) (← links)
- Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick) (Q4121710) (← links)
- Experiments in mixed-integer linear programming using pseudo-costs (Q4136935) (← links)
- Polyhedral annexation in mixed integer and combinatorial programming (Q4139972) (← links)
- Design of cellular manufacturing systems (Q4230194) (← links)
- (Q4253792) (← links)
- Column-Generation in Integer Linear Programming (Q4450558) (← links)
- Some mathematical aspects of price optimisation (Q4583609) (← links)
- From feasibility to improvement to proof: three phases of solving mixed-integer programs (Q4637827) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- Mixed-Integer Programming for Cycle Detection in Nonreversible Markov Processes (Q4643799) (← links)
- Die Lösung eines nichtlinearen Investitionsproblems mit Hilfe binärer Optimierungsalgorithmen — gezeigt am Beispiel der Planung regionaler Abwasserbehandlungssysteme (Q4766821) (← links)
- Trivial integer programs unsolvable by branch-and-bound (Q4770206) (← links)
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm (Q4966750) (← links)
- Conflict Analysis for MINLP (Q4995080) (← links)
- Conflict-Driven Heuristics for Mixed Integer Programming (Q4995097) (← links)
- Estimating the Size of Branch-and-Bound Trees (Q5085999) (← links)
- Probabilistic partial set covering problems (Q5202816) (← links)
- Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben (Q5558794) (← links)
- Experiments in mixed-integer linear programming (Q5642449) (← links)
