The following pages link to Computers \& Operations Research (Q162215):
Displaying 50 items.
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants (Q1040968) (← links)
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods (Q1040972) (← links)
- Numerical transient analysis of Markov models (Q1101812) (← links)
- Competition-based neural network for the multiple travelling salesmen problem with minmax objective (Q1302604) (← links)
- An algorithm for the determination of optimal cutting patterns (Q1348556) (← links)
- A new heuristic algorithm for probabilistic optimization (Q1362975) (← links)
- An interactive procedure dedicated to a bicriteria plant location model. (Q1413829) (← links)
- Brand choice model selection based on consumers' multicriteria preferences and experts' knowledge (Q1569908) (← links)
- Structural, elicitation and computational issues faced when solving complex decision making problems with influence diagrams (Q1569910) (← links)
- A greedy genetic algorithm for the quadratic assignment problem (Q1577374) (← links)
- On the first-order estimation of multipliers from Kuhn-Tucker systems (Q1592583) (← links)
- A myopic policy for the gradual obsolescence problem with price-dependent demand (Q1603310) (← links)
- Deterministic allocation models for multi-period demand fulfillment in multi-stage customer hierarchies (Q1628044) (← links)
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times (Q1628056) (← links)
- Integrated production and transportation on parallel batch machines to minimize total weighted delivery time (Q1628115) (← links)
- Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines (Q1634065) (← links)
- Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization (Q1634077) (← links)
- Mixed integer linear programming models for optimal crop selection (Q1652214) (← links)
- Achieving full connectivity of sites in the multiperiod reserve network design problem (Q1652228) (← links)
- The probabilistic orienteering problem (Q1652250) (← links)
- Multiperiod portfolio investment using stochastic programming with conditional value at risk (Q1652255) (← links)
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- Multi-period technician scheduling with experience-based service times and stochastic customers (Q1652258) (← links)
- The traveling purchaser problem with time-dependent quantities (Q1652259) (← links)
- VCS: A new heuristic function for selecting boxes in the single container loading problem (Q1652261) (← links)
- Multi-vehicle prize collecting arc routing for connectivity problem (Q1652266) (← links)
- A hybrid integer and constraint programming approach to solve nurse rostering problems (Q1652269) (← links)
- Balancing stochastic two-sided assembly line with multiple constraints using hybrid teaching-learning-based optimization algorithm (Q1652273) (← links)
- The multi-objective assembly line worker integration and balancing problem of type-2 (Q1652274) (← links)
- Multiobjective programming for sizing and locating biogas plants: a model and an application in a region of Portugal (Q1652307) (← links)
- Competitive liner shipping network design (Q1652407) (← links)
- Optimal procurement decision with a carbon tax for the manufacturing industry (Q1652490) (← links)
- A two-phase heuristic for an in-port ship routing problem with tank allocation (Q1652535) (← links)
- Testing probabilistic models of choice using column generation (Q1652625) (← links)
- An extensive operations and maintenance planning problem with an efficient solution method (Q1652643) (← links)
- Risk shaping of optimal electricity portfolios in the stochastic LCOE theory (Q1652696) (← links)
- Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level (Q1654372) (← links)
- An agency perspective for multi-mode project scheduling with time/cost trade-offs (Q1722976) (← links)
- An exact algorithm for the minimum squared load assignment problem (Q1734825) (← links)
- Mind the gap: a study of tube tour (Q1761218) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
- The bi-objective stochastic covering tour problem (Q1762147) (← links)
- On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties (Q1765543) (← links)
- Two-mode modularity clustering of parts and activities for cell formation problems (Q1782160) (← links)
- A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms (Q1782170) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
- An improved genetic algorithm for facility layout problems having inner structure walls and passages (Q1869891) (← links)
- Towards unified formulations and extensions of two classical probabilistic location models (Q1886724) (← links)
