![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Computers & Operations Research, Volume 58
Volume 58, June 2015
- Jaehwan Yang:
Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage. 1-8 - Francisco A. Ortega
, Miguel A. Pozo
, Justo Puerto:
Modelling and planning public cultural schedules for efficient use of resources. 9-23 - Jian-Jun Wang
, Bing-Hang Zhang:
Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects. 24-31 - Laureano F. Escudero
, Juan Francisco Monge
, Dolores Romero Morales
:
An SDP approach for multiperiod mixed 0-1 linear programming models with stochastic dominance constraints for risk management. 32-40 - Daniel Baena, Jordi Castro
, José A. González
:
Fix-and-relax approaches for controlled tabular adjustment. 41-52 - Rafael Martí
, Angel Corberán
, Juanjo Peiró
:
Scatter search for an uncapacitated p-hub median problem. 53-66 - Kun He, Menglong Huang, Chenkai Yang:
An action-space-based global optimization algorithm for packing circles into a square container. 67-74 - Jérémy Omer
:
A space-discretized mixed-integer linear model for air-conflict resolution with speed and heading maneuvers. 75-86 - Thibaut Vidal
, Maria Battarra
, Anand Subramanian
, Günes Erdogan
:
Hybrid metaheuristics for the Clustered Vehicle Routing Problem. 87-99
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.