Pages that link to "Item:Q62319"

The following pages link to European Journal of Operational Research (Q62319):

Displaying 50 items.

• Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
• Regularized generalized canonical correlation analysis for multiblock or multigroup data analysis (Q296769) (← links)
• The clustered orienteering problem (Q296772) (← links)
• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774) (← links)
• Hybrid large neighborhood search for the bus rapid transit route design problem (Q296775) (← links)
• A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
• The static bicycle relocation problem with demand intervals (Q296779) (← links)
• Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm (Q296782) (← links)
• The two-machine no-wait general and proportionate open shop makespan problem (Q296784) (← links)
• Construction of asymmetric copulas and its application in two-dimensional reliability modelling (Q296786) (← links)
• Convergence of controlled models and finite-state approximation for discounted continuous-time Markov decision processes with constraints (Q296787) (← links)
• Random sampling: billiard walk algorithm (Q296789) (← links)
• Multi-stage stochastic fluid models for congestion control (Q296794) (← links)
• Demand seasonality in retail inventory management (Q296797) (← links)
• A synergy of multicriteria techniques to assess additive value models (Q296799) (← links)
• The analytic hierarchy process with stochastic judgements (Q296803) (← links)
• Monotonicity and the Aumann-Shapley cost-sharing method in the discrete case (Q296806) (← links)
• The SEXTANT software: a tool for automating the comparative analysis of mental models of dynamic systems (Q296809) (← links)
• A mathematical model proposal for cost-effective course planning in large hierarchical organizations (Q296813) (← links)
• Fast and fine quickest path algorithm (Q296816) (← links)
• An activity-based costing decision model for life cycle assessment in green building projects (Q296821) (← links)
• Reducing patient-flow delays in surgical suites through determining start-times of surgical cases (Q296824) (← links)
• Robust competence assessment for job assignment (Q296828) (← links)
• Hierarchical differential evolution for minimal cut sets identification: application to nuclear safety systems (Q296832) (← links)
• Integrating deterioration and lifetime constraints in production and supply chain planning: a survey (Q296854) (← links)
• Incremental network design with shortest paths (Q296857) (← links)
• Branch-and-cut algorithms for the split delivery vehicle routing problem (Q296858) (← links)
• A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
• Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
• Total completion time with makespan constraint in no-wait flowshops with setup times (Q296867) (← links)
• Optimal deterministic algorithms for some variants of online quota traveling salesman problem (Q296870) (← links)
• An integrated approach for earthwork allocation, sequencing and routing (Q296873) (← links)
• New results for the directed profitable rural postman problem (Q296876) (← links)
• Aggregation of Malmquist productivity indexes allowing for reallocation of resources (Q296878) (← links)
• Order monotonic solutions for generalized characteristic functions (Q296883) (← links)
• Bidding in sequential electricity markets: the Nordic case (Q296886) (← links)
• Fast computation of bounds for two-terminal network reliability (Q296891) (← links)
• Consumption-investment strategies with non-exponential discounting and logarithmic utility (Q296894) (← links)
• Survivable network design with shared-protection routing (Q296897) (← links)
• Cure events in default prediction (Q296900) (← links)
• Distribution-free vessel deployment for liner shipping (Q296901) (← links)
• An implicit enumeration algorithm for the passenger service planning problem: application to the Taiwan railways administration line (Q296903) (← links)
• A robust-CVaR optimization approach with application to breast cancer therapy (Q296907) (← links)
• Decomposition and local search based methods for the traveling umpire problem (Q296910) (← links)
• Estimating the technical efficiency of health care systems: a cross-country comparison using the directional distance function (Q296913) (← links)
• Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
• An arc-exchange decomposition method for multistage dynamic networks with random arc capacities (Q296965) (← links)
• Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
• Global optimization of signomial geometric programming problems (Q296971) (← links)
• An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem (Q296973) (← links)