Pages that link to "Item:Q285917"
From MaRDI portal
The following pages link to EURO Journal on Computational Optimization (Q285917):
Displayed 50 items.
- On global optimization with indefinite quadratics (Q1707078) (← links)
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem (Q1707079) (← links)
- Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
- Variable neighborhood search: basics and variants (Q1707084) (← links)
- Robust combinatorial optimization under budgeted-ellipsoidal uncertainty (Q1731817) (← links)
- Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation (Q1731818) (← links)
- Robust bilateral trade with discrete types (Q1731822) (← links)
- Multipolar robust optimization (Q1731824) (← links)
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
- A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights (Q1742901) (← links)
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
- New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
- A decomposition-based heuristic for large employee scheduling problems with inter-department transfers (Q2175366) (← links)
- A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem (Q2175368) (← links)
- Learning to steer nonlinear interior-point methods (Q2175369) (← links)
- Integration of routing into a resource-constrained project scheduling problem (Q2175371) (← links)
- A robust \(p\)-center problem under pressure to locate shelters in wildfire context (Q2195562) (← links)
- A distributionally robust optimization approach for two-stage facility location problems (Q2195563) (← links)
- On conditional cuts for stochastic dual dynamic programming (Q2195564) (← links)
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods (Q2219510) (← links)
- An exploratory computational analysis of dual degeneracy in mixed-integer programming (Q2219511) (← links)
- A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber (Q2219513) (← links)
- An exact approach for the multi-constraint graph partitioning problem (Q2219514) (← links)
- Computing Euclidean Steiner trees over segments (Q2219516) (← links)
- The complete vertex \(p\)-center problem (Q2219518) (← links)
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← links)
- Observation thinning in data assimilation computations (Q2260913) (← links)
- A primal heuristic for optimizing the topology of gas networks based on dual information (Q2260914) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
- A branch-and-cut algorithm for the target visitation problem (Q2294072) (← links)
- Core group placement: allocation and provisioning of heterogeneous resources (Q2294073) (← links)
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers (Q2294074) (← links)
- Complementarity-based nonlinear programming techniques for optimal mixing in gas networks (Q2294075) (← links)
- Special issue on bilevel optimization (Q2308183) (← links)
- Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games (Q2308184) (← links)
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario (Q2308185) (← links)
- Joint location and pricing within a user-optimized environment (Q2308187) (← links)
- Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent (Q2308188) (← links)
- Ten years of feasibility pump, and counting (Q2329705) (← links)
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707) (← links)
- A polyhedral approach to the generalized minimum labeling spanning tree problem (Q2329708) (← links)
- Real-time algorithms for the bilevel double-deck elevator dispatching problem (Q2329709) (← links)
- Special issue on: Nonlinear and combinatorial methods for energy optimization (Q2397753) (← links)
- Uncontrolled inexact information within bundle methods (Q2397754) (← links)
- A multiplicative weights update algorithm for MINLP (Q2397756) (← links)
- A bounded degree SOS hierarchy for polynomial optimization (Q2397758) (← links)
- A comparison of four approaches from stochastic programming for large-scale unit-commitment (Q2397759) (← links)
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints (Q2397760) (← links)