Pages that link to "Item:Q285917"
From MaRDI portal
The following pages link to EURO Journal on Computational Optimization (Q285917):
Displaying 50 items.
- Special issue on ``Non-linear continuous optimization'' (Q285918) (← links)
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions (Q285919) (← links)
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (Q285921) (← links)
- Dualization and discretization of linear-quadratic control problems with bang-bang solutions (Q285924) (← links)
- On the application of an augmented Lagrangian algorithm to some portfolio problems (Q285925) (← links)
- A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics (Q285928) (← links)
- Models for video-on-demand scheduling with costs (Q286685) (← links)
- Optimal capacitated ring trees (Q286687) (← links)
- Generalized minimum spanning tree games (Q286691) (← links)
- Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators (Q286692) (← links)
- Evacuation modeling: a case study on linear and nonlinear network flow models (Q339928) (← links)
- Robust flows with losses and improvability in evacuation planning (Q339930) (← links)
- Network design to anticipate selfish evacuation routing (Q339932) (← links)
- A multi-period shelter location-allocation model with evacuation orders for flood disasters (Q339935) (← links)
- Sink location to find optimal shelters in evacuation planning (Q339937) (← links)
- Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers (Q339938) (← links)
- Road network emergency accessibility planning after a major earthquake (Q339942) (← links)
- Solution methodologies for debris removal in disaster response (Q339944) (← links)
- Applying ranking and selection procedures to long-term mitigation for improved network restoration (Q339947) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- Strong and compact relaxations in the original space using a compact extended formulation (Q458127) (← links)
- Column generation for extended formulations (Q458128) (← links)
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- Robust balanced optimization (Q668952) (← links)
- Portfolio optimization with \(pw\)-robustness (Q668953) (← links)
- A robust basic cyclic scheduling problem (Q668955) (← links)
- A hybrid approach to the solution of a pricing model with continuous demand segmentation (Q743631) (← links)
- Worst case complexity of direct search (Q743632) (← links)
- Evaluating performance of image segmentation criteria and techniques (Q743635) (← links)
- Open problems on graph eigenvalues studied with AutoGraphiX (Q743636) (← links)
- Restrict-and-relax search for 0-1 mixed-integer programs (Q743638) (← links)
- Special issue on computational methods for network optimization problems (Q743639) (← links)
- Lagrangian decompositions for the two-level FTTx network design problem (Q743641) (← links)
- Speeding up column generation for robust wireless network planning (Q743642) (← links)
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (Q743645) (← links)
- Special issue on ``Applied bilevel programming'' (Q748593) (← links)
- Bilevel programming for price-based electricity auctions: a revenue-constrained case (Q748595) (← links)
- Global resolution of the support vector machine regression parameters selection problem with LPCC (Q748597) (← links)
- A globally convergent algorithm for MPCC (Q748600) (← links)
- PANDA: a software for polyhedral transformations (Q904954) (← links)
- An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness (Q904955) (← links)
- Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition (Q904957) (← links)
- Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective (Q1616824) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- Improved integral simplex using decomposition for the set partitioning problem (Q1616829) (← links)
- Another pedagogy for mixed-integer Gomory (Q1688937) (← links)
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems (Q1688940) (← links)
- On the construction of quadratic models for derivative-free trust-region algorithms (Q1688943) (← links)
- Nonsmooth spectral gradient methods for unconstrained optimization (Q1688945) (← links)
