The following pages link to XPRESS (Q16992):
Displaying 50 items.
- Robust optimization of internal transports at a parcel sorting center operated by Deutsche Post world net (Q1037666) (← links)
- Knapsack problems with setups (Q1041933) (← links)
- Piece-wise linear approximation of functions of two variables (Q1365113) (← links)
- Solving a fuel delivery problem by heuristic and exact approaches. (Q1410332) (← links)
- Dynamic knapsack sets and capacitated lot-sizing (Q1411629) (← links)
- Identification of piecewise affine systems via mixed-integer programming. (Q1426258) (← links)
- A goal programming model for partner selection decisions in international joint ventures (Q1600946) (← links)
- Supply chain disruption management using stochastic mixed integer programming (Q1625210) (← links)
- A robust optimization approach to diet problem with overall glycemic load as objective function (Q1634044) (← links)
- CVaR distance between univariate probability distributions and approximation problems (Q1640043) (← links)
- Parallelizing the dual revised simplex method (Q1646685) (← links)
- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior (Q1652139) (← links)
- The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production (Q1652159) (← links)
- A decomposition approach for the \(p\)-median problem on disconnected graphs (Q1652380) (← links)
- A biased random-key genetic algorithm for the maximum quasi-clique problem (Q1653365) (← links)
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories (Q1686524) (← links)
- Delay resistant line planning with a view towards passenger transfers (Q1688439) (← links)
- Compact extended linear programming models (Q1693865) (← links)
- Improved handling of uncertainty and robustness in set covering problems (Q1695010) (← links)
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
- Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price (Q1725820) (← links)
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems (Q1750397) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Stochastic short-term hydropower planning with inflow scenario trees (Q1751942) (← links)
- An adaptive robust portfolio optimization model with loss constraints based on data-driven polyhedral uncertainty sets (Q1752147) (← links)
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem (Q1752190) (← links)
- Oil production optimization solved by piecewise linearization in a branch \& price framework (Q1761184) (← links)
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees (Q1762093) (← links)
- Network design formulations for scheduling U.S. air force channel route missions (Q1767116) (← links)
- Polyhedral approximation in mixed-integer convex optimization (Q1800994) (← links)
- A penalty function heuristic for the resource constrained shortest path problem (Q1848355) (← links)
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
- A brief history of linear and mixed-integer programming computation (Q1946013) (← links)
- \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs (Q1961983) (← links)
- Computation of multi-facility location Nash equilibria on a network under quantity competition (Q2005792) (← links)
- Nash equilibria in location games on a network (Q2014595) (← links)
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
- Order acceptance for motorail transportation with uncertain parameters (Q2018112) (← links)
- Accelerating Benders decomposition for short-term hydropower maintenance scheduling (Q2028814) (← links)
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
- The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers (Q2044966) (← links)
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (Q2062317) (← links)
- Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
- New formulations and solutions for the strategic berth template problem (Q2076915) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- An optimization-based approach to assess non-interference in labeled and bounded Petri net systems (Q2123401) (← links)
- Adaptive large neighborhood search for mixed integer programming (Q2146445) (← links)
- Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty (Q2160510) (← links)
- Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
- Transferring information across restarts in MIP (Q2170173) (← links)
