Results 51 to 60 of about 105 (99)
0–1 equivalent model representations for air traffic management
0–1 equivalent models, tightening LP relaxations, strong valid cuts, 90C10, 90B35,
Laureano Escudero, Antonio Alonso
core +1 more source
An approach for solving a modification of the extended rapid transit network design problem
Station and link location, Circular line, Line designing, Degree of a node, 90B06, 90B80, 90C10, 90C35,
L. Escudero, S. Muñoz
core +1 more source
Computing the sequence of k-cardinality assignments. [PDF]
J Comb Optim, 2022 Rosenmann A.
europepmc +1 more source
On due-date based valid cuts for the sequential ordering problem
Integer Programming, Lagrangean relaxation, Hamiltonian Path, Valid Cuts, Tightening, 90C10, 90C27, 90C30,
L. Escudero, M. Ortuño
core +1 more source
Mathematical Optimization for the Train Timetabling Problem [PDF]
, 2010 AMS Subj. Classification: 90C57; 90C10;Rail transportation is very rich in terms of problems that can be modelled and solved using mathematical optimization techniques. The train scheduling problem as the most important part of a rail operating policy has
Marić, Miroslav +4 more
core
Covering Convex Bodies and the Closest Vector Problem. [PDF]
Discrete Comput Geom, 2022 Naszódi M, Venzin M.
europepmc +1 more source
A new pricing scheme based on DEA for iterative multi-unit combinatorial auctions
DEA efficiency, Winner-determination algorithm, Auction design, Combinatorial auction, Iterative multi-unit auction, 90-02, 90C10, 90B50,
Juan Aparicio +3 more
core +1 more source
About the complexity of two-stage stochastic IPs. [PDF]
Math Program, 2022 Klein KM.
europepmc +1 more source
Complexity of linear relaxations in integer programming. [PDF]
Math Program, 2022 Averkov G, Schymura M.
europepmc +1 more source
Special issue on: Computational discrete optimization
EURO Journal on Computational Optimization, 2020 ArieM.C.A. Koster, Clemens Thielen
doaj +1 more source