The following pages link to 4OR (Q262441):
Displaying 50 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- Improved algorithms for single machine scheduling with release dates and rejections (Q262445) (← links)
- Assortment optimization under a multinomial logit model with position bias and social influence (Q262450) (← links)
- Mean-value at risk portfolio efficiency: approaches based on data envelopment analysis models with negative data and their empirical behaviour (Q262452) (← links)
- A line search trust-region algorithm with nonmonotone adaptive radius for a system of nonlinear equations (Q295877) (← links)
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness (Q295879) (← links)
- Parallel-machine scheduling with release dates and rejection (Q295880) (← links)
- Pooling heterogeneous products for manufacturing environments (Q295883) (← links)
- Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem (Q295887) (← links)
- Rescheduling with new orders and general maximum allowable time disruptions (Q330107) (← links)
- On the optimization of two-class work-conserving parameterized scheduling policies (Q330110) (← links)
- An application of support vector machines to sales forecasting under promotions (Q330115) (← links)
- An extension of the flowsort sorting method to deal with imprecision (Q372935) (← links)
- A necessary 4-cycle condition for dice representability of reciprocal relations (Q372937) (← links)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- Bicriteria path problem minimizing the cost and minimizing the number of labels (Q385462) (← links)
- MPOC: an agglomerative algorithm for multicriteria partially ordered clustering (Q385464) (← links)
- Complexity and in-approximability of a selection problem in robust optimization (Q385465) (← links)
- Using multi-objective evolutionary algorithms for single-objective optimization (Q385470) (← links)
- Delay analysis of a discrete-time multiclass slot-bound priority system (Q427556) (← links)
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- A simulated annealing hyper-heuristic methodology for flexible decision support (Q427562) (← links)
- Robust energy planning in buildings with energy and comfort costs (Q427565) (← links)
- A characterisation of stable sets in preordered structure (Q427567) (← links)
- Internet shopping with price sensitive discounts (Q457290) (← links)
- Discounted continuous-time Markov decision processes with unbounded rates and randomized history-dependent policies: the dynamic programming approach (Q457293) (← links)
- Linear separation and approximation by minimizing the sum of concave functions of distances (Q457295) (← links)
- Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost (Q457296) (← links)
- A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration (Q483728) (← links)
- A branch and bound algorithm for minimizing the energy consumption of an electrical vehicle (Q483731) (← links)
- On the sufficient descent condition of the Hager-Zhang conjugate gradient methods (Q483732) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- The bottleneck transportation problem with auxiliary resources (Q496104) (← links)
- Suppliers' competition and manufacturer's product mix: the role of ingredient brand (Q496105) (← links)
- A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures (Q496107) (← links)
- A brand new cheating attempt: a case of usurped identity (Q503656) (← links)
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures (Q503659) (← links)
- GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem (Q503664) (← links)
- The shape of the yield and its impact on inventory decisions (Q503666) (← links)
- A heuristic and hybrid method for the tank allocation problem in maritime bulk shipping (Q503667) (← links)
- Balancing two-sided U-type assembly lines using modified particle swarm optimization algorithm (Q523563) (← links)
- Finite approximation for finite-horizon continuous-time Markov decision processes (Q523564) (← links)
- A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update (Q523565) (← links)
- Third order duality in nonlinear programming problems (Q523566) (← links)
- Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
- A fast heuristic for a three-dimensional non-convex domain loading problem (Q538281) (← links)
- Functional optimization by variable-basis approximation schemes (Q538282) (← links)
- Stochastic hybrid simulation. With applications to wired and wireless queueing networks (Q538284) (← links)
- A column generation algorithm for the vehicle routing problem with soft time windows (Q538287) (← links)
- Metaheuristics for multiobjective optimisation. Cooperative approaches, uncertainty handling and application in logistics (Q548670) (← links)
